Approaching the DT bound using linear codes in the short blocklength regime

Luis Salamanca; Juan Jose Murillo-Fuentes; Pablo M. Olmos; Fernando Perez-Cruz; Sergio Verdu

doi:10.1109/LCOMM.2014.2371032

Approaching the DT bound using linear codes in the short blocklength regime

Luis Salamanca, Juan Jose Murillo-Fuentes, Pablo M. Olmos, Fernando Perez-Cruz, Sergio Verdu

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

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.

Original language	English (US)
Article number	6957577
Pages (from-to)	123-126
Number of pages	4
Journal	IEEE Communications Letters
Volume	19
Issue number	2
DOIs	https://doi.org/10.1109/LCOMM.2014.2371032
State	Published - Feb 1 2015

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Keywords

LDPC codes
ML decoding
binary erasure channel
finite blocklength regime
random coding

Access to Document

10.1109/LCOMM.2014.2371032

Cite this

@article{871c259773d64f3fa1cc5f019d73f640,

title = "Approaching the DT bound using linear codes in the short blocklength regime",

abstract = "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.",

keywords = "LDPC codes, ML decoding, binary erasure channel, finite blocklength regime, random coding",

author = "Luis Salamanca and Murillo-Fuentes, {Juan Jose} and Olmos, {Pablo M.} and Fernando Perez-Cruz and Sergio Verdu",

note = "Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2015",

month = feb,

day = "1",

doi = "10.1109/LCOMM.2014.2371032",

language = "English (US)",

volume = "19",

pages = "123--126",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Approaching the DT bound using linear codes in the short blocklength regime

AU - Salamanca, Luis

AU - Murillo-Fuentes, Juan Jose

AU - Olmos, Pablo M.

AU - Perez-Cruz, Fernando

AU - Verdu, Sergio

PY - 2015/2/1

Y1 - 2015/2/1

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

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

KW - LDPC codes

KW - ML decoding

KW - binary erasure channel

KW - finite blocklength regime

KW - random coding

UR - http://www.scopus.com/inward/record.url?scp=84923069946&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84923069946&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2014.2371032

DO - 10.1109/LCOMM.2014.2371032

M3 - Article

AN - SCOPUS:84923069946

SN - 1089-7798

VL - 19

SP - 123

EP - 126

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 2

M1 - 6957577

ER -

Approaching the DT bound using linear codes in the short blocklength regime

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this