An efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

IEEE Transactions on Information Theory

Volumn 50, Issue 11, 2004, Pages 2837-2844

  Burshtein, David ^a   Miller, Gadi ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b Algotec Systems   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY;

BINARY ERASURE CHANNEL (BEC); ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODES (LDPC); MAXIMUM LIKELIHOOD DECODING;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (22)

1. L. Bazzi, T. Richardson, and R. Urbanke, "Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A," IEEE Trans. Inform. Theory. Also available at http://cm.bell-labs.com/cm/ms/who/tjr/pub.html, submitted for publication.
2. D. Burshtein and G. Miller, "Bounds on the performance of belief propagation decoding," IEEE Trans. Inform. Theory, vol. 48, pp. 112-122, Jan. 2002.
3. D. Coppersmith, "Solving linear equations over GF(2): Block Lanczos algorithm," Linear Alg. Applic., vol. 192, pp. 33-60, 1993.
4. D. Coppersmith, "Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm," Math. of Comput., vol. 62, no. 205, pp. 333-350, Jan. 1994.
5. D. Coppersmith, A. Odlyzko, and R. Schroeppel, "Discrete logarithms in GF(p)," Algorithmica, vol. 1, pp. 1-15, 1986.
6. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," in Proc. 19th ACM Symp. Theory of Computing, 1987, pp. 1-6.
7. P. Elias, "Coding for two noisy channels" in Proc. 3rd London Symp. Information Theory, 1955, pp. 61-76.
8. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
9. M. R. Hestenes and E. Stiefel, "Methods of conjugate gradients for solving linear systems," J. Res. Nat. Bur. Stand., vol. 49, pp. 409-436, 1952.
10. B. A. LaMacchia and A. M. Odlyzko, "Solving large sparse linear systems over finite fields," in Advances in Cryptology: CRYPTO '90 (Lecture Notes in Computer Science), A. Menezes and S. Vanstone, Eds. Berlin, Germany: Springer-Verlag, 1991, vol. 537, pp. 109-133.
11. C. Lanczos, "Solution of systems of linear equations by minimized iterations," J. Res. Nat. Bur. Stand., vol. 49, pp. 33-53, 1952.
12. M. Luby, M. Mitzenmacher, and M. A. Shokrollahi, "Analysis of random processes via and-or tree evaluation," in Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, 1998, pp. 364-373.
13. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 569-584, Feb. 2001.
14. M. G. Luby, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp, 585-598, Feb. 2001.
15. P. L. Montgomery, "A block Lanczos algorithm for finding dependencies over GF(2)," in Advances in Cryptology: EUROCRYPT '95 (Lecture Notes in Computer Science), L. C. Guillou and J. J. Quisquater, Eds. Berlin, Germany: Springer-Verlag, 1995, vol. 921, pp. 106-120.
16. A. M. Odlyzko, "Discrete logarithms in finite fields and their cryptographic significance," in Advances in Cryptology: Proceedings of Eurocrypt '84 (Lecture Notes in Computer Science), T. Beth, N. Cot, and I. Ingemarsson, Eds. Berlin, Germany: Springer-Verlag, 1985, vol. 209, pp. 224-314.
17. A. M. Odlyzko, "Discrete logarithms: The past and the future" Des., Codes Cryptogr., vol. 19, no. 2-3, pp. 129-145, Mar. 2000.
18. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes" IEEE Trans. Inform. Theory, vol. 47, pp. 638-656, Feb. 2001.
19. V. Strassen, "Gaussian elimination is not optimal" Numerische Math., vol. 13, pp. 354-356, 1969.
20. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
21. J. Teitelbaum, "Euclid's algorithm and the Lanczos method over finite fields," Math. Comput., vol. 67, no. 224, pp. 1665-1678, Oct. 1998.
22. D. Wiedemann, "Solving sparse linear equations over finite fields," IEEE Trans. Inform. Theory, vol. IT-32, pp. 54-62, Jan. 1986.