Typical performance of regular low-density parity-check codes over general symmetric channels

DOI10.1088/0305-4470/36/43/033MaRDI QIDQ5696402zbMATH OpenOpenAlexFDO

Authors Toshiyuki Tanaka, David Saad

Publication date 18 October 2005

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0204554

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: Typical performance of low-density parity-check (LDPC) codes over a general binary-input output-symmetric memoryless channel is investigated using methods of statistical mechanics. Theoretical framework for dealing with general symmetric channels is provided, based on which Gallager and MacKay-Neal codes are studied as examples of LDPC codes. It has been shown that the basic properties of these codes known for particular channels, including the property to potentially saturate Shannon's limit, hold for general symmetric channels. The binary-input additive-white-Gaussian-noise channel and the binary-input Laplace channel are considered as specific channel noise models.

Recommendations

• Statistical mechanics of low-density parity-check codes
• Bounds on the performance of belief propagation decoding
• Low-density parity-check codes and the related performance analysis methods
• Performance of low-density parity-check codes with linear minimum distance
• Design of capacity-approaching irregular low-density parity-check codes

Cited in

(6)

• The typical performance of irregular low-density generator-matrix codes for lossy compression
• Gallager error-correcting codes for binary asymmetric channels
• Statistical mechanics analysis of LDPC coding in MIMO Gaussian channels
• Density Evolution for Asymmetric Memoryless Channels
• Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
• The rate of regular ldpc codes

This page was built for publication: Typical performance of regular low-density parity-check codes over general symmetric channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696402)