On Random-Coding Union Bounds with and Without Erasures

Eli Haim; Yuval Kochman; Uri Erez

doi:10.1109/TIT.2018.2825357

On Random-Coding Union Bounds with and Without Erasures

Eli Haim, Yuval Kochman, Uri Erez

The Rachel and Selim Benin School of Engineering and Computer Science

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

Abstract

Upper bounds on the error probability of channel coding are derived for codebooks drawn from random codebook ensembles with various independence and symmetry assumptions. For regular decoding (without an erasure option), the random coding union bound of Polyanskiy et al. is improved by carefully taking ties (equal likelihood scores) into account. It is shown that the improved bound is always better than threshold-decoding based bounds. The framework is extended to the case of decoding with an erasure option, deriving several achievability bounds in the same spirit. In order to exemplify the merits of the approach, the bounds are evaluated for the case of pairwise-independent uniformly-distributed ensembles (e.g., shifted random linear codes).

Original language	American English
Pages (from-to)	4294-4308
Number of pages	15
Journal	IEEE Transactions on Information Theory
Volume	64
Issue number	6
DOIs	https://doi.org/10.1109/TIT.2018.2825357
State	Published - Jun 2018

Bibliographical note

Funding Information:
Manuscript received September 13, 2015; revised November 21, 2017; accepted January 30, 2018. Date of publication April 10, 2018; date of current version May 18, 2018. E. Haim and U. Erez was supported by the Israel Science Foundation under Grant 1956/15. E. Haim and Y. Kochman was supported by the Israel Science Foundation under Grant 956/12. Y. Kochman was supported in part by the HUJI Cyber Security Research Center in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office and in part by the German-Israeli Foundation for Scientific Research and Development. This paper was presented at the 2013 International Symposium on Information Theory.

Publisher Copyright:
© 1963-2012 IEEE.

Keywords

Finite blocklength bounds
erasure decoding
maximum-likelihood decoding
random-coding union bound
threshold decoding
tie-breaking

Access to Document

10.1109/TIT.2018.2825357

Cite this

@article{24bc4d4011844a6b84c88989647fd840,

title = "On Random-Coding Union Bounds with and Without Erasures",

abstract = "Upper bounds on the error probability of channel coding are derived for codebooks drawn from random codebook ensembles with various independence and symmetry assumptions. For regular decoding (without an erasure option), the random coding union bound of Polyanskiy et al. is improved by carefully taking ties (equal likelihood scores) into account. It is shown that the improved bound is always better than threshold-decoding based bounds. The framework is extended to the case of decoding with an erasure option, deriving several achievability bounds in the same spirit. In order to exemplify the merits of the approach, the bounds are evaluated for the case of pairwise-independent uniformly-distributed ensembles (e.g., shifted random linear codes).",

keywords = "Finite blocklength bounds, erasure decoding, maximum-likelihood decoding, random-coding union bound, threshold decoding, tie-breaking",

author = "Eli Haim and Yuval Kochman and Uri Erez",

note = "Funding Information: Manuscript received September 13, 2015; revised November 21, 2017; accepted January 30, 2018. Date of publication April 10, 2018; date of current version May 18, 2018. E. Haim and U. Erez was supported by the Israel Science Foundation under Grant 1956/15. E. Haim and Y. Kochman was supported by the Israel Science Foundation under Grant 956/12. Y. Kochman was supported in part by the HUJI Cyber Security Research Center in conjunction with the Israel National Cyber Bureau in the Prime Minister{\textquoteright}s Office and in part by the German-Israeli Foundation for Scientific Research and Development. This paper was presented at the 2013 International Symposium on Information Theory. Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2018",

month = jun,

doi = "10.1109/TIT.2018.2825357",

language = "American English",

volume = "64",

pages = "4294--4308",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "6",

}

TY - JOUR

T1 - On Random-Coding Union Bounds with and Without Erasures

AU - Haim, Eli

AU - Kochman, Yuval

AU - Erez, Uri

N1 - Funding Information: Manuscript received September 13, 2015; revised November 21, 2017; accepted January 30, 2018. Date of publication April 10, 2018; date of current version May 18, 2018. E. Haim and U. Erez was supported by the Israel Science Foundation under Grant 1956/15. E. Haim and Y. Kochman was supported by the Israel Science Foundation under Grant 956/12. Y. Kochman was supported in part by the HUJI Cyber Security Research Center in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office and in part by the German-Israeli Foundation for Scientific Research and Development. This paper was presented at the 2013 International Symposium on Information Theory. Publisher Copyright: © 1963-2012 IEEE.

PY - 2018/6

Y1 - 2018/6

N2 - Upper bounds on the error probability of channel coding are derived for codebooks drawn from random codebook ensembles with various independence and symmetry assumptions. For regular decoding (without an erasure option), the random coding union bound of Polyanskiy et al. is improved by carefully taking ties (equal likelihood scores) into account. It is shown that the improved bound is always better than threshold-decoding based bounds. The framework is extended to the case of decoding with an erasure option, deriving several achievability bounds in the same spirit. In order to exemplify the merits of the approach, the bounds are evaluated for the case of pairwise-independent uniformly-distributed ensembles (e.g., shifted random linear codes).

AB - Upper bounds on the error probability of channel coding are derived for codebooks drawn from random codebook ensembles with various independence and symmetry assumptions. For regular decoding (without an erasure option), the random coding union bound of Polyanskiy et al. is improved by carefully taking ties (equal likelihood scores) into account. It is shown that the improved bound is always better than threshold-decoding based bounds. The framework is extended to the case of decoding with an erasure option, deriving several achievability bounds in the same spirit. In order to exemplify the merits of the approach, the bounds are evaluated for the case of pairwise-independent uniformly-distributed ensembles (e.g., shifted random linear codes).

KW - Finite blocklength bounds

KW - erasure decoding

KW - maximum-likelihood decoding

KW - random-coding union bound

KW - threshold decoding

KW - tie-breaking

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

U2 - 10.1109/TIT.2018.2825357

DO - 10.1109/TIT.2018.2825357

M3 - Article

AN - SCOPUS:85045313828

SN - 0018-9448

VL - 64

SP - 4294

EP - 4308

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

ER -

On Random-Coding Union Bounds with and Without Erasures

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this