Capacity-achieving sequences for the erasure channel

IEEE Transactions on Information Theory

Volumn 48, Issue 12, 2002, Pages 3017-3028

  Oswald, Peter ^a   Shokrollahi, Amin ^a,b  

^a LUCENT TECHNOLOGIES   (United States)

^b Digital Fountain Inc   (United States)

Author keywords

Erasure channel; Low density parity check codes; Sparse graphs

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; GRAPH THEORY; POLYNOMIALS;

CAPACITY-ACHIEVING SEQUENCES;

CHANNEL CAPACITY;

EID: 0036913621     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.805067     Document Type: Article

References (7)

1. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, Feb. 2001.
2. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
3. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
4. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 569-584, Feb. 2001.
5. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (Lecture Notes in Computer Science), M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. New York: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
6. A. Shokrollahi and R. Storn, "Design of efficient erasure codes with differential evolution," in Proc. IEEE Int. Symp. Information Theory (ISIT'00), Sorrento, Italy, 2000, p. 5.
7. W. Walter, Analysis. Berlin, Germany: Springer-Verlag, 1992, vol. 1 and 2.