The ML decoding performance of LDPC ensembles over ℤZq

IEEE Transactions on Information Theory

Volumn 51, Issue 5, 2005, Pages 1871-1879

  Erez, Uri ^a   Miller, Gadi ^b  

^a Department of Electrical Engineering and Computer Science   (United States)

^b TELECOM PARISTECH   (France)

Author keywords

Additive white Gaussian noise (AWGN) channel; Arbitrary alphabet size; Code spectrum; Low density parity check (LDPC) codes; Maximum likelihood (ML) decoding; Modulo additive noise channels

Indexed keywords

CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; DISCRETE FOURIER TRANSFORMS; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; RANDOM PROCESSES; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE (AWGN) CHANNEL; ARBITRARY ALPHABET SIZE; CODE SPECTRUM; LOW DENSITY PARITY CHECK (LDPC) CODES; MAXIMUM LIKELIHOOD (ML) DECODING; MODULO ADDITIVE NOISE CHANNELS;

CODES (SYMBOLS);

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

References (11)

1. M. C. Davey and D. J. C. Mackay, "Low density parity check codes over GF(q)," in Proc. Information Theory Workshop, Killarney, Ireland, Jun. 1998, pp. 70-71.
2. b )," in Proc. Int. Symp. Information Theory (ISIT2003), Yokohama, Japan, Jun. 2003, p. 87.
3. K. Narayan and J. Li, "Bandwidth efficient low density parity check coding using multilevel coding and iterative multistage decoding," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France. Sep. 2000, pp. 165-168.
4. R. G. Gallager, Low Density Parity Check Codes. Cambridge. MA: MIT Press. 1963.
5. U. Erez, "Coding with known interference and some results on lattices for digital communication," Ph.D. dissertation, Tel-Aviv Univ., Tel-Aviv. Israel, 2002.
6. A. Bennatan and D. Burshtein, "On the application of LDPC codes to arbitrary discrete-memoryless channels," IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 417-438, Mar. 2004.
7. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
8. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing LDPC codes," presented at the 40th Annu. Conf. Communication, Control and Computing, Monticello, IL, Oct. 2002. Submitted to IEEE Trans. Inf. Theory.
9. S. Litsyn and V. Shevelev, "On ensembles of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inf. Theory , vol. 48, no. 4, pp. 887-908, Apr. 2002.
10. N. Shulman and M. Feder, "Random coding techniques for nonrandom codes," IEEE Trans. Inf. Theory, vol. 45, no. 9, pp. 2101-2104, Sep. 2002.
11. G. Miller and D. Burshtein, "Bounds on the maximum likelihood decoding error probability of low density parity check codes," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2696-2710, Nov. 2001.