Fully Absorbing Set Enumerators for Protograph-Based LDPC Code Ensembles

The average finite-length (elementary) fully absorbing set enumerators for binary protograph-based low-density parity-check (LDPC) code ensembles are derived. The method relies on generating functions, and it provides an efficient mean to obtain the normalized logarithmic asymptotic distribution of...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2022-12, Vol.26 (12), p.1-1
Main Authors: Yacoub, Emna Ben, Liva, Gianluigi
Format: Article
Language:English
Subjects:
asymptotic enumeration
Asymptotic properties
Bipartite graph
Error correcting codes
Fully absorbing sets
Indexes
Iterative decoding
Navigation
Parity check codes
protograph-based LDPC codes
Symbols
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The average finite-length (elementary) fully absorbing set enumerators for binary protograph-based low-density parity-check (LDPC) code ensembles are derived. The method relies on generating functions, and it provides an efficient mean to obtain the normalized logarithmic asymptotic distribution of (elementary) fully absorbing sets. Using these results, the asymptotic distribution of (elementary) fully absorbing sets is evaluated for some protograph-based LDPC code ensembles. Numerical results show how the distributions can be used to estimate the error floor performance of protograph LDPC codes.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2022.3208771