Average and reliability error exponents in low-density parity-check codes

DOI10.1088/0305-4470/36/43/032MaRDI QIDQ5696401zbMATH OpenOpenAlexFDO

Authors Nikos S. Skantzos, J. van Mourik, Yoshiyuki Kabashima, 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/0304520, https://publications.aston.ac.uk/id/eprint/1363/1/NCRG_2003_005.pdf

zbMATH Keywords

error exponentlow-densityparity-check code

Mathematics Subject Classification ID

Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We present a theoretical method for a direct evaluation of the average and reliability error exponents in low-density parity-check error-correcting codes using methods of statistical physics. Results for the binary symmetric channel (BSC) are presented for codes of both finite and infinite connectivity.

Recommendations

• Error Exponents of Typical Random Codes
• Error Exponents of Typical Random Trellis Codes
• scientific article; zbMATH DE number 2127881
• Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
• Error Exponents of Expander Codes under Linear-Complexity Decoding
• Error exponents of expander codes
• Error estimates for low rate codes
• A Lagrange–Dual Lower Bound to the Error Exponent of the Typical Random Code
• The exponent of error probability in various modulation and coding systems
• scientific article; zbMATH DE number 3559420

Cited in

(2)

• Gallager error-correcting codes for binary asymmetric channels
• On the Error Exponent and the Use of LDPC Codes for Cooperative Sensor Networks With Misinformed Nodes

This page was built for publication: Average and reliability error exponents in low-density parity-check codes

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