On the errror correction of regular LDPC codes using the flipping algorithm

IEEE Transactions on Information Theory

Volumn 54, Issue 2, 2008, Pages 517-530

  Burshtein, David ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Expander graph; Flipping algorithm; Iterative decoding; Low density parity check (LDPC) codes

Indexed keywords

ALGORITHMS; ERROR CORRECTION; ITERATIVE DECODING; RANDOM ERRORS;

EXPANDER GRAPH; FLIPPING ALGORITHM; LOW-DENSITY PARITY-CHECK CODES;

CODES (SYMBOLS);

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

References (17)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. V. V. Zyablov and M. S. Pinsker, "Estimation of the error-correction complexity for Gallager low-density codes," Probl. Inf. Transm., vol. 11, no. 1, pp. 18-28, May 1976.
3. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
4. D. Burshtein and G. Miller, "Expander graph arguments for message passing algorithms," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 782-790, Feb. 2001.
5. M. J. Wainwright, J. Feldman, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory vol. 51, no. 3, pp. 954-972, Mar. 2005.
6. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J. Wainwright, "LP decoding corrects a constant fraction of errors," in Proc. IEEE Int. Symp. Information Theory (ISIT 2004), Chicago, IL, Jun./Jul. 2004, p. 69.
7. C. Daskalakis, A. G. Dimakis, R. M. Karp, and M. J. Wainwright, "Probabilistic analysis of linear programming decoding," in Proc. 18th Annu. ACM-SIAM Symp. Discrete Algorithms, New Orleans, LA, Jan. 2007, pp. 385-394.
8. M. Lentmaier, D. V. Truhachev, K. Sh. Zigangirov, and D. J. Costello, "An analysis of the block error probability performance of iterative decoding," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3834-3855, Nov. 2005.
9. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Speilman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
10. 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.
11. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing LDPC codes," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1115-1131, Jun. 2004.
12. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, preliminary version available at http:// Ithcwww.epfl.ch/mct/index.php.
13. D. Burshtein and G. Miller, "Bounds on the performance of belief propagation decoding," IEEE Trans. Inf. Theory, vol. 48, no. 1, pp. 112-122, Jan. 2002.
14. D. Burshtein, M. Krivelevich, S. Litsyn, and G. Miller, "Upper bounds on the rate of LDPC codes," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2437-2449, Sep. 2002.
15. S. K. Chilappagari and B. Vasić, "Error correction capability of column-weight-three LDPC codes," submitted for publication, arXiv:0710.3427v1.
16. T. J. Richardson, "Error floors of LDPC codes," in Proc. 41th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2003, pp. 1426-1435.
17. D. Burshtein, "Nondirect convergence radius and number of iterations of the hopfield associative memory," IEEE Trans. Inf. Theory, vol. 40, no. 3, pp. 838-847, May 1994.