Abstract:
We investigate a systematic construction of binary deterministic rateless codes (BDRCs). The codes are for networks with erasure channels. With a maximum distance separab...Show MoreMetadata
Abstract:
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.
Published in: 2008 IEEE International Symposium on Information Theory
Date of Conference: 06-11 July 2008
Date Added to IEEE Xplore: 08 August 2008
ISBN Information:
ISSN Information:
References is not available for this document.
Contents Select All
1.
M. Xiao, M. Médard, and T. Aulin, "A binary coding approach for combination networks and general erasure networks," in Proc. IEEE Int. Sym. on Info. Theory (ISIT), Nice, France, Jun. 2007, pp. 786-790.
2.
S. Lin and D. J. Costello. Jr., Error Control Coding. New Jersey, USA: Prentice Hall, 2004.
3.
J. Kurose and K. Ross, Computer Networking: A Top-Down Approach Featuring the Internet (third edition). New York, USA: Pearson Addison-Wesley, 2005.
4.
I. Reed and G. Solomon, "Polynomial codes over certain finite fields," Journal of the Society for Industrial and Applied Mathematics, vol. 8, pp. 300-304, Jun. 1960.
5.
M. Luby, "LT codes," in Proc. the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), Nov. 2002, pp. 271-282.
6.
A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
7.
J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," in Proc. ACM Sigcomm 98, Vancouver, Canada, Sep. 1998, pp. 56-67.
8.
M. Xiao, "Efficient coding techniques for networks channels with transmission errors," Ph.D thesis, Chalmers university of technology, Gothenburg, Sweden. http://www.ce.chalmers.se/, Nov. 2007.
9.
M. Blaum, J. Bruck, and A. Vardy, "MDS array codes with independent parity symbols," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 529-542, Mar. 1996.
10.
H. Fujita and K. Sakaniwa, "Some classes of quasi-cyclic LDPC codes: Properties and efficient encoding method," IEICE Transactions on Fundamentals, vol. E88-A, no. 12, pp. 3627-3635, Dec. 2005.
11.
M. Blaum and R. Roth, "New array codes for multiple phased burst correction," IEEE Trans. Inf. Theory, vol. 39, pp. 66-77, Sep. 1993.
12.
F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes. New York, NY: North-Holland, 1978.
