LDPC codes; Finite blocklength regime; ML decoding; Binary erasure channel; Random Coding
Résumé :
[en] The dependence-testing (DT) bound is one of the
strongest achievability bounds for the binary erasure channel
(BEC) in the finite block length regime. In this paper, we show that
maximum likelihood decoded regular low-density parity-check
(LDPC) codes with at least 5 ones per column almost achieve
the DT bound. Specifically, using quasi-regular LDPC codes with
block length of 256 bits, we achieve a rate that is less than 1% away
from the rate predicted by the DT bound for a word error rate
below 10^−3. The results also indicate that the maximum-likelihood
solution is computationally feasible for decoding block codes over
the BEC with several hundred bits.
Centre de recherche :
Luxembourg Centre for Systems Biomedicine (LCSB)
Disciplines :
Ingénierie électrique & électronique
Auteur, co-auteur :
SALAMANCA MINO, Luis ; University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB)
Murillo-Fuentes, Juan José; University of Sevilla > Signal Theory and Communications
Martinez-Olmos, Pablo; University Carlos III Madrid > Signal processing and communications
Pérez-Cruz, Fernando; University Carlos III Madrid > Signal processing and communications
Verdú, Sergio; Princeton University > Information Sciences and Systems group
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime
Date de publication/diffusion :
février 2015
Titre du périodique :
IEEE Communications Letters
ISSN :
1089-7798
eISSN :
1558-2558
Maison d'édition :
Institute of Electrical and Electronics Engineers, New York, Etats-Unis - New York
