Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks

IEEE Transactions on Information Theory

Volumn 38, Issue 6, 1992, Pages 1833-1839

  Radosavljevic, Branko ^a   Arikan, Erdal ^b   Hajek, Bruce ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; TREES (MATHEMATICS);

ADAPTIVE REORDERING; BINARY ERASURE CHANNELS; DECODING ALGORITHMS; PARITY CHECK CODES; SEQUENTIAL CODING;

DECODING;

EID: 0026955723     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.165462     Document Type: Article

References (12)

1. G. C. Clark and J. B. Cain, Error-Correction Coding for Digital Communications. New York: Plenum Press, 1981.
2. D. D. Falconer, “A hybrid sequential and algebraic decoding scheme,” Ph.D. dissert., Dept. of Elect. Eng., Massachusetts Inst, of Technol., Cambridge, MA, 1967.
3. G. D. Forney, Jr., “Coset codes Part II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
4. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
5. “Low-density parity-check codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
6. Low-Density Parity-Check Codes. Cambridge, MA: M.I.T. Press, 1963.
7. I. M. Jacobs and E. R. Berlekamp, “A lower bound to the distribution of computation for sequential decoding,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 167-174, Apr. 1967.
8. M. S. Pinsker, “On the complexity of decoding,” Probl. Inform. Trans, (translation of Probl. Peredach. Inform), vol. 1, pp. 84-86, Jan.-Mar. 1965.
9. B. Radosavljevic, “Sequential decoding with adaptive reordering of codeword trees,” M.S. thesis, Tech. Rep. UILU-ENG-90-2209, Coor. Sci. Lab., Univ. of Illinois, Urbana, IL, Mar. 1990.
10. J. K. Wolf, “Efficient maximum likelihood decoding of linear blocks codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, Jan. 1978.
11. V. V. Zyablov and M. S. Pinsker, “Decoding complexity of low-density codes for transmission in a channel with erasures,” Probl. Inform. Trans, (translation of Probl. Peredach. Inform.), vol. 10, pp. 10-21, Jan.-Mar. 1974.
12. “Estimation of the error-correction complexity for Gallager low-density codes,” Probl. Inform. Trans, (translation of Probl. Peredach. Inform), vol. 11, pp. 18-28, Jan.-Mar. 1975.