Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime

Salamanca Mino, Luis; Murillo-Fuentes, Juan José; Martinez-Olmos, Pablo; Pérez-Cruz, Fernando; Verdú, Sergio

doi:10.1109/LCOMM.2014.2371032

Reference : Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime


	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Electrical & electronics engineering
	Focus Areas :	Security, Reliability and Trust
	To cite this reference:	http://hdl.handle.net/10993/26637

Title :	Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime
Language :	English
Author, co-author :	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]
Publication date :	Feb-2015
Journal title :	IEEE Communications Letters
Publisher :	Institute of Electrical and Electronics Engineers
Volume :	19
Pages :	123-126
Peer reviewed :	Yes (verified by ORBi^lu)
Audience :	International
ISSN :	1089-7798
City :	New York
Country :	NY
Keywords :	[en] LDPC codes ; Finite blocklength regime ; ML decoding ; Binary erasure channel ; Random Coding
Abstract :	[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.
Research centres :	Luxembourg Centre for Systems Biomedicine (LCSB)
Permalink :	http://hdl.handle.net/10993/26637
DOI :	10.1109/LCOMM.2014.2371032

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Limited access	comlet2015.pdf		Publisher postprint	314.73 kB	Request a copy

All documents in ORBi^lu are protected by a user license.

University of Luxembourg Library | Feedback | Legal notices