5 search results - page 1 / 1 » Ensemble Enumerators for Protograph-Based Generalized LDPC C... |
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protographbased...
ICC
2007
IEEE
13 years 8 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
TIT
2002
13 years 4 months ago
2002
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...
BMCBI
2006
13 years 4 months ago
2006
Background: The identification of a consensus RNA motif often consists in finding a conserved secondary structure with minimum free energy in an ensemble of aligned sequences. How...