Predicting error floors of structured LDPC codes: deterministic bounds and estimates
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices
IEEE Transactions on Communications
IEEE Transactions on Information Theory - Part 1
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Codes on graphs: normal realizations
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
On the minimum distance of array codes as LDPC codes
IEEE Transactions on Information Theory
LDPC block and convolutional codes based on circulant matrices
IEEE Transactions on Information Theory
Stopping set distribution of LDPC code ensembles
IEEE Transactions on Information Theory
Using linear programming to Decode Binary linear codes
IEEE Transactions on Information Theory
Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
IEEE Transactions on Information Theory
Predicting error floors of structured LDPC codes: deterministic bounds and estimates
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices
IEEE Transactions on Communications
On the dynamics of the error floor behavior in (regular) LDPC codes
IEEE Transactions on Information Theory
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Constructing short-length irregular LDPC codes with low error floor
IEEE Transactions on Communications
Hi-index | 754.90 |
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to approach the Shannon limits for suitably large block lengths. For the intermediate block lengths relevant in applications, however, many LDPC codes exhibit a so-called "error floor," corresponding to a significant flattening in the curve that relates signal-to-noise ratio (SNR) to the bit-error rate (BER) level. Previous work has linked this behavior to combinatorial substructures within the Tanner graph associated with an LDPC code, known as (fully) absorbing sets. These fully absorbing sets correspond to a particular type of near-codewords or trapping sets that are stable under bit-flipping operations, and exert the dominant effect on the low BER behavior of structured LDPC codes. This paper provides a detailed theoretical analysis of these (fully) absorbing sets for the class of Cp, γ array-based LDPC codes, including the characterization of all minimal (fully) absorbing sets for the array-based LDPC codes for γ = 2, 3, 4, and moreover, it provides the development of techniques to enumerate them exactly. Theoretical results of this type provide a foundation for predicting and extrapolating the error floor behavior of LDPC codes.