On the Error Exponents of LDPC Codes Approaching Capacity Under a Low-Complexity Decoding Algorithm
This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. For these codes transmitted over the memoryless binary symmetric channel (BSC), we derive lower bounds on the error exponents for both the well-known maximum-likelihood (ML) and proposed low-complexity d...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-02-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/23/2/253 |