Weight vs. Magnetization Enumerator for Gallager Codes

DOI10.1007/3-540-45325-3_14MaRDI QIDQ4550264zbMATH OpenOpenAlexFDO

Authors J. van Mourik, Yoshiyuki Kabashima, David Saad

Publication date 27 November 2002

Published in Cryptography and Coding (Search for Journal in Brave)

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

zbMATH Keywords

critical noise leveldecoding Gallager type low density parity check error correcting codesmagnetization enumerator

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60)

Abstract: We propose a method to determine the critical noise level for decoding Gallager type low density parity check error correcting codes. The method is based on the magnetization enumerator ($cM$), rather than on the weight enumerator ($cW$) presented recently in the information theory literature. The interpretation of our method is appealingly simple, and the relation between the different decoding schemes such as typical pairs decoding, MAP, and finite temperature decoding (MPM) becomes clear. Our results are more optimistic than those derived via the methods of information theory and are in excellent agreement with recent results from another statistical physics approach.

Recommendations

• Gallager error-correcting codes for binary asymmetric channels
• Statistical mechanics of low-density parity-check codes
• Lowering the error floor of Gallager codes: a statistical-mechanical view
• Performance of low density parity check codes as a function of actual and assumed noise levels
• Statistical mechanics and capacity-approaching error-correcting codes

Cited in

(2)

• Lowering the error floor of Gallager codes: a statistical-mechanical view
• Gallager error-correcting codes for binary asymmetric channels

This page was built for publication: Weight vs. Magnetization Enumerator for Gallager Codes

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