Systematic network coding for time-division duplexing
Author(s)
Medard, Muriel; Lucani, Daniel Enrique; Stojanovic, Milica
DownloadMedard_Systematic network.pdf (167.7Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
We present a systematic network coding approach for time-division duplexing channels. In particular, we study the case of a node transmitting to a single receiver. We show that the use of systematic network coding using XORs can provide the same or close to the same performance in terms of completion time as a random linear network coding scheme that uses a large field size, with the added advantage of requiring fewer and simpler operations during the decoding process. We show that the average computation required to decode using systematic network coding in an erasure channel grows as O(M3Pe3), where M is the number of original packets being coded together, and Pe is the packet erasure probability. This means that systematic network coding requires Pe-3 times fewer operations on average than random linear network coding with the same field size.
Date issued
2010-07Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of ElectronicsJournal
Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2010
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Médard, Muriel et al. "Systematic network coding for time-division duplexing." Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2010: 2403-2407. ©2010 IEEE.
Version: Original manuscript
Other identifiers
INSPEC Accession Number: 11446019
ISBN
978-1-4244-7891-0
978-1-4244-7890-3