Results on the improved decoding algorithm for low-density parity-check codes over the binary erasure channel

IEEE Transactions on Information Theory

Volumn 53, Issue 4, 2007, Pages 1510-1520

  Vellambi, Badri N ^a   Fekri, Faramarz ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Connected component; Depth first search; Graph contraction; Improved decoding algorithm; Induced subgraph; Low density parity check (LDPC) codes; Message passing decoder; Valency

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMPUTER SIMULATION; GRAPHIC METHODS; ITERATIVE DECODING; MESSAGE PASSING;

BINARY ERASURE CHANNEL; DEPTH-FIRST SEARCH; GRAPH CONTRACTION; INDUCED SUBGRAPH; LOW-DENSITY PARITY-CHECK CODES; TANNER GRAPH;

CODES (SYMBOLS);

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

References (19)

1. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, pp. 599-618, Feb. 2001.
2. P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, pp. 3017-3028, Dec. 2002.
3. M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. AAECC-13, 1999, pp. 65-76, Lecture Notes in Compute Science 1719.
4. C. Di, D. Proietti, I. E. Telatar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, pp. 1570-1579, Jun. 2002.
5. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, pp. 569-584, Feb. 2001.
6. M. A. Shokrollahi, "Capacity-achieving sequences," Math. Appl., vol. 123, pp. 153-166, 2000.
7. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes over the binary erasure channel," IEEE Trans. Inf. Theory, vol. 50, pp. 439-454, Mar. 2004.
8. N. Varnica and M. Fossorier, "Belief-propagation with information correction: Improved near maximum-likelihood decoding for low-density parity-check codes," in Proc. 2004 IEEE Symp. Inf. Theory, Chicago, IL, Jun. 2004.
9. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes over the binary erasure channel," in Proc. 37th Annual Conf. Inf. Sci. Syst., Mar. 2003.
10. H. Pishro-Nik and F. Fekri, "Improved decoding algorithms for low-density parity-check codes," in Proc. 3rd Int. Symp. Turbo Codes and Rel. Topics, Brest, France.
11. D. Burshtein and G. Miller, "An efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel," IEEE Trans. Inf. Theory, vol. 50, pp. 2837-2844, Nov. 2004.
12. B. N. V. Ravisankar and F. Fekri, "On stopping sets and an improved decoding algorithm for low-density parity-check codes over the binary erasure channel," in Proc. Forty-Second Annual Allerton Conf. Commun., Contr. Comput., Monticello, Oct. 2004.
13. B. D. McKay, "Asymptotics for 0-1 matrices with prescribed line sums," in Enumeration and Design. New York: Academic, 1984, pp. 225-238.
14. A. Békéssy, P. Békéssy, and J. Kolmós, "Asymptotic enumeration of regular matrices," Studia Scientiarum Mathematicarum Hungarica, vol. 7, pp. 343-353, 1972.
15. B. D. McKay, "Asymptotics for symmetric 0-1 matrices with prescribed row sums," Ars Combinatoria, vol. 19A, pp. 15-26, 1985.
16. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing LDPC codes," IEEE Trans. Inf. Theory, vol. 50, pp. 1115-1131, Jun. 2004.
17. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. Inf. Theory, vol. 51, pp. 929-953, Mar. 2005.
18. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: The MIT Press, 2001.
19. B. Bollobás, Modern Graph Theory, 1st ed. New York: Springer-Verlag, 2002.