Paper Info
Title
Systematic network coding for time-division duplexing
Abstract
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.
Year
DOI
Venue
2010
10.1109/ISIT.2010.5513768
Information Theory Proceedings
Keywords
Field
DocType
decoding,demultiplexing,linear codes,network coding,probability,random codes,time division multiplexing,XOR,decoding process,packet erasure channel probability,random linear network coding scheme,single receiver,systematic network coding approach,time-division duplexing channels
Linear network coding,Discrete mathematics,Computer science,Network packet,Computer network,Algorithm,Binary erasure channel,Shannon–Fano coding,Decoding methods,Time-division multiplexing,Erasure,Variable-length code
Conference
ISBN
Citations 
PageRank 
978-1-4244-7891-0
8
0.77
References 
Authors
0
3
Name
Order
Citations
PageRank
Daniel Enrique Lucani121718.06
Muriel Médard26828599.31
Milica Stojanovic31056153.29