The ML decoding performance of LDPC ensembles over Zq

Authors:
U. Erez;G. Miller
Affiliations:
Dept. of Electr. Eng. & Comput. Sci., Massachusetts Inst. of Technol., Cambridge, MA, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 7

Performance analysis of linear codes under maximum-likelihood decoding: a tutorial

Communications and Information Theory
Construction of Universal Codes Using LDPC Matrices and Their Error Exponents

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Construction of Lossy Source Code Using LDPC Matrices

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The capacity of finite Abelian group codes over symmetric memoryless channels

IEEE Transactions on Information Theory
Coding theorem for general stationary memoryless channel based on hash property

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Performance bounds for nonbinary linear block codes over memoryless symmetric channels

IEEE Transactions on Information Theory
Hash property and coding theorems for sparse matrices and maximum-likelihood coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	755.02

Visualization

Abstract

We derive the asymptotic spectra of low-density parity-check (LDPC) ensembles over Zq. We consider two ensembles of LDPC matrices, one is binary and the other q-ary. We also show that for modulo-additive noise channels, both ensembles achieve the random coding error exponent, for graphs with sufficiently large connectivity.