Error Exponents of LDPC Codes under Low-Complexity Decoding

Error Exponents of LDPC Codes under Low-Complexity Decoding

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 de...

Full description

Bibliographic Details
Main Authors: Pavel Rybin, Kirill Andreev, Victor Zyablov
Format: Article
Language:English
Published: MDPI AG 2021-02-01
Series:Entropy
Subjects:
low-density parity check (LDPC) codes
Gallager’s LDPC codes
binary LDPC codes
decoding algorithm
low-complexity
error exponent
Online Access:https://www.mdpi.com/1099-4300/23/2/253

Similar Items

Similar Items