Binary Systematic Network Coding for Progressive Packet Decoding

Abstract

We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional network coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve the theoretical optimal performance. Furthermore, we demonstrate that systematic network codes equipped with the proposed algorithm are good candidates for progressive packet recovery owing to their overall decoding delay characteristics.

Proc. of IEEE ICC 2015 - Communication Theory Symposium, to appear

Cited by in corpus (5)

• Decoding Delay Performance of Random Linear Network Coding for Broadcast
• Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services
• Performance Analysis of Random Linear Network Coding in Two-Source Single-Relay Networks
• On the Probability of Partial Decoding in Sparse Network Coding
• Decoding Probability Analysis of Network-Coded Data Collection and Delivery by Relay Drones