Raptor codes on binary memoryless symmetric channels

IEEE Transactions on Information Theory

Volumn 52, Issue 5, 2006, Pages 2033-2051

  Etesami, Omid ^a   Shokrollahi, Amin ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b EPFL   (Switzerland)

Author keywords

Belief propagation; Graphical codes; LT codes; Raptor codes

Indexed keywords

APPROXIMATION THEORY; CODES (SYMBOLS); DECODING; GRAPH THEORY; OPTIMIZATION; PROBABILITY;

BELIEF-PROPAGATION DECODER; BINARY INPUT MEMORYLESS SYMMETRIC CHANNELS (BIMSCS); GAUSSIAN APPROXIMATION TECHNIQUE; GRAPHICAL CODES; RAPTOR CODES;

INFORMATION THEORY;

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

References (27)

1. R. G. Gallager, Low Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
3. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
4. D. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
5. D. MacKay and R. Neal, "Good codes based on very sparse matrices," in Proc. 5th IMA Conf., Cryptography and Coding (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 1025, pp. 100-111.
6. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
7. D. Spielman, "Linear-time encodable and decodable error-correcting codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1723-1731, Nov. 1996.
8. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 29th Annu. ACM Symp. Theory of Computing, El Paso, TX, May 1997, pp. 150-159.
9. M. Luby, M. Mitzenmacher, and A. Shokrollahi, "Analysis of random processes via and-or tree evaluation," in Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, Jan. 1998, pp. 364-373.
10. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
11. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for 'turbo-like' codes," in Proc. 1998 Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 1998, pp. 201-210.
12. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
13. M. Luby, "Information Additive Code Generator and Decoder for Communication Systems," U.S. Patent,307 487, Oct. 23, 2001.
14. M. Luby, "Information Additive Code Generator and Decoder for Communication Systems," U.S. Patent,373 406, Apr. 16, 2002.
15. M. Luby, "LT-codes," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science, Vancouver, BC, Canada, Nov. 2002, pp. 271-280.
16. A. Shokrollahi, "Raptor codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 36.
17. S.-Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
18. H. El Gamal and A. Hammons, "Analyzing the turbo decoder using the Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 671-686, Feb. 2001.
19. A. Shokrollahi, Capacity-Achieving Sequences. Minneapolis, MN: Inst. Mathematics and its Applications (IMA), 2000, vol. 123, IMA Volumes in Mathematics and its Applications, pp. 153-166.
20. M. Ardakani and F. Kschischang, "A More Accurate One-Dimensional Analysis and Design of LDPC Codes," preprint, 2003.
21. T. Richardson and R. Urbanke, "Modern Coding Theory," preprint, 2004.
22. R. Palanki and J. Yedidia, "Rateless codes on noisy channels," in Proc. IEEE In. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 37.
23. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
24. P. Pakzad, private communication, 2004.
25. I. Sason, private communication, 2004.
26. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
27. A. Khandekar, "Graph-based codes and iterative decoding," Ph.D. dissertation, Calif. Ins. Technol., Pasadena, 2002.