## 2015 |

Salamanca, Luis; Murillo-Fuentes, Juan José; Olmos, Pablo M; Perez-Cruz, Fernando; Verdu, Sergio Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime Journal Article IEEE Communications Letters, 19 (2), pp. 123–126, 2015, ISSN: 1089-7798. Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding @article{Salamanca2014bb, title = {Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime}, author = {Luis Salamanca and Juan José Murillo-Fuentes and Pablo M Olmos and Fernando Perez-Cruz and Sergio Verdu}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6957577}, doi = {10.1109/LCOMM.2014.2371032}, issn = {1089-7798}, year = {2015}, date = {2015-02-01}, journal = {IEEE Communications Letters}, volume = {19}, number = {2}, pages = {123--126}, 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 paritycheck (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 103. The results also indicate that the maximum-likelihood solution is computationally feasible for decoding block codes over the BEC with several hundred bits.}, keywords = {binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding}, pubstate = {published}, tppubtype = {article} } 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 paritycheck (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 103. The results also indicate that the maximum-likelihood solution is computationally feasible for decoding block codes over the BEC with several hundred bits. |

## 2014 |

Campo, Adria Tauste; Vazquez-Vilar, Gonzalo; i Fàbregas, Albert Guillén; Koch, Tobias; Martinez, Alfonso A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions Journal Article IEEE Transactions on Information Theory, 60 (6), pp. 3209–3217, 2014, ISSN: 0018-9448. Abstract | Links | BibTeX | Tags: ALCIT, Channel Coding, COMONSENS, DEIPRO, error probability, joint source-channel coding, Joints, MobileNET, Probability distribution, product distributions, random coding, Reliability, reliability function, sphere-packing bound, Upper bound @article{TausteCampo2014, title = {A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions}, author = {Adria Tauste Campo and Gonzalo Vazquez-Vilar and Albert Guillén i Fàbregas and Tobias Koch and Alfonso Martinez}, url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6803047 http://www.tsc.uc3m.es/~koch/files/IEEE_TIT_60(6).pdf}, issn = {0018-9448}, year = {2014}, date = {2014-01-01}, journal = {IEEE Transactions on Information Theory}, volume = {60}, number = {6}, pages = {3209--3217}, publisher = {IEEE}, abstract = {This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight.}, keywords = {ALCIT, Channel Coding, COMONSENS, DEIPRO, error probability, joint source-channel coding, Joints, MobileNET, Probability distribution, product distributions, random coding, Reliability, reliability function, sphere-packing bound, Upper bound}, pubstate = {published}, tppubtype = {article} } This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight. |

Salamanca, Luis; Murillo-Fuentes, Juan José; Olmos, Pablo M; Perez-Cruz, Fernando; Verdu, Sergio Near DT Bound Achieving Linear Codes in the Short Blocklength Regime Journal Article IEEE Communications Letters, PP (99), pp. 1–1, 2014, ISSN: 1089-7798. Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding @article{Salamanca2014bb, title = {Near DT Bound Achieving Linear Codes in the Short Blocklength Regime}, author = {Luis Salamanca and Juan José Murillo-Fuentes and Pablo M Olmos and Fernando Perez-Cruz and Sergio Verdu}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6957577}, issn = {1089-7798}, year = {2014}, date = {2014-01-01}, journal = {IEEE Communications Letters}, volume = {PP}, number = {99}, pages = {1--1}, 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 paritycheck (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 103. The results also indicate that the maximum-likelihood solution is computationally feasible for decoding block codes over the BEC with several hundred bits.}, keywords = {binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding}, pubstate = {published}, tppubtype = {article} } 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 paritycheck (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 103. The results also indicate that the maximum-likelihood solution is computationally feasible for decoding block codes over the BEC with several hundred bits. |