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 discarding potentially useful information. Thus, using forward error correction (FEC) in each coded packet makes the corrupted packets useful at the receiver. In this letter, 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.

中文翻译：

---

提高网络编码中数据包恢复的解码速度

通信信道的可靠性是无线通信中最具挑战性的任务之一。网络编码（NC）已成为一种引人注目的解决方案，可以通过发送编码的数据包并在接收端接受有效的数据包来提高吞吐量性能和可靠性。在NC中丢弃损坏的编码数据包通常意味着丢弃潜在的有用信息。因此，在每个编码的分组中使用前向纠错（FEC）使得损坏的分组在接收器处有用。在这封信中，我们提出了一种用于NC中数据包恢复的快速解码算法（F-PRNC），它使用编码数据包之间的代数一致性来检测其可能的损坏部分。我们提供了F-PRNC的复杂性分析，并将其与DAPRAC和S-PRAC等部分数据包恢复方案进行了比较。