Systematic Binary Deterministic Rateless Codes
Paper in proceedings, 2008

We investigate a systematic construction of binary deterministic rateless codes (BDRCs). The codes are for networks with erasure channels. With a maximum distance separable(MDS) property, non-systematic BDRCs were first proposed in[1] with encoding complexity O(K), and decoding complexity is O(K2). Here K is the length of information bits. To reduce complexity, we study systematic-BDRCs (SBDRCs). For SBDRCs, the source first transmits m − 1 uncoded blocks, where m is the number of source blocks. Then, the source produces and transmits coded blocks in a rateless way. These coded blocks are produced using only cyclic-shift and XOR (exclusive or). The SBDRCs can use a large number of information blocks (potentially infinite m). On receiving any m distinct blocks (uncoded or coded), a sink can rebuild the source. The SBDRCs have encoding complexity O(εK), and decoding complexity O(ε2K2), where ε is the source-to-sink block erasure probability.

cyclic shift and XOR.

erasure channels

Network coding

rateless codes

Author

Ming Xiao

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Tor Aulin

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Muriel Médard

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

International Symposium on Information Theory, Proceedings

2066-2070

Subject Categories

Telecommunications

More information

Created

10/7/2017