Improving the Decoding Speed of Packet Recovery in Network Coding

Hosein K. Nazari, Kiana Ghassabi, Peyman Pahlevani, Daniel Enrique Lucani Rötter

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review


The reliability of communication channels is one of the most challenging tasks in wireless communication. Network coding (NC) has emerged as a compelling solution to improve throughput performance and reliability by sending coded packets and accepting valid ones at the receiver. Discarding corrupted coded packets in NC often meant to discard potentially useful information. Thus, using forward error correction (FEC) in each coded packet makes the corrupted packets useful at the receiver. In this paper, we propose a fast decoding algorithm for packet recovery in NC (F-PRNC) using an algebraic consistency between the coded packets to detect their possible corrupted parts. We provided a complexity analysis of the F-PRNC and compared it with partial packet recovery schemes such as DAPRAC and S-PRAC. Our simulation result shows that F-PRNC exceeds both methods in a variety of conditions.
Original languageEnglish
Article number9226485
JournalIEEE Communications Letters
Pages (from-to)351-355
Number of pages5
Publication statusPublished - Feb 2021


  • Network coding
  • algebraic consistency rule
  • forward error correction
  • random linear network coding


Dive into the research topics of 'Improving the Decoding Speed of Packet Recovery in Network Coding'. Together they form a unique fingerprint.

Cite this