Error Exponents of LDPC Codes under Low-Complexity Decoding
Open Access
Abstract
This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum-likelihood (ML) and proposed low-complexity decoding algorithms. We prove the existence of such LDPC codes that the probability of erroneous decoding decreases exponentially with the growth of the code length while keeping coding rates below the corresponding channel capacity. We also show that an obtained error exponent lower bound under ML decoding almost coincide with the error exponents of good linear codes.Keywords
Funding Information
- Russian Foundation for Basic Research (19-37-51036)
This publication has 11 references indexed in Scilit:
- On the Error Exponents of Capacity Approaching Construction of LDPC code2018
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codesProblems of Information Transmission, 2015
- On the error-correcting capabilities of low-complexity decoded irregular LDPC codes2014
- Analysis of the relation between properties of LDPC codes and the tanner graphProblems of Information Transmission, 2012
- Estimation of the exponent of the decoding error probability for a special generalized LDPC codeJournal of Communications Technology and Electronics, 2012
- Asymptotic estimation of error fraction corrected by binary LDPC code2011
- Lower Bounds on the Error Rate of LDPC Code EnsemblesIEEE Transactions on Information Theory, 2007
- Upper Bounds on the Error Exponents of LDPC Code Ensembles2006
- Error Exponents of Expander Codes under Linear-Complexity DecodingSIAM Journal on Discrete Mathematics, 2004
- Error exponents of expander codesIEEE Transactions on Information Theory, 2002