On code parameters and coding vector representation for practical RLNC
Name
Medard_On Code Parameters.pdf
Size
280.13 KB
Format
Adobe PDF
Checksum (MD5)
03cfd6b0ce94693321ae1e667186ac12
Author(s)
Heide, Janus
Pedersen, Morten V.
Fitzek, Frank H. P.
Medard, Muriel
Date Issued
July 2011
Journal
Proceedings of the IEEE International Conference on Communications (ICC), 2011
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Heide, Janus et al. “On Code Parameters and Coding Vector Representation for Practical RLNC.” IEEE International Conference on Communications (ICC), 2011. 1–5.
Version
Author's final manuscript
Abstract
Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the encoding vector. Increasing the field size and generation length presents a fundamental trade-off between packet-based throughput and operational overhead. On the one hand, decreasing the probability of redundant packets' being transmitted is beneficial for throughput and, consequently, reduces transmission energy. On the other hand, the decoding complexity and amount of header overhead increase with field size and generation length, leading to higher energy consumption. The main findings of this work are bounds for the transmission overhead due to linearly dependent packets. The optimal trade-off is system and topology dependent, as it depends on the cost in energy of performing coding operations versus transmitting data. We show that moderate field sizes are the correct choice when trade-offs are considered. The results show that sparse binary codes perform the best, unless the generation size is very low.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/icc.2011.5963013
