On Random-Coding Union Bounds With and Without Erasures

Autor:	Eli Haim, Yuval Kochman, Uri Erez
Rok vydání:	2018
Předmět:	Discrete mathematics Codebook Library and Information Sciences Computer Science Applications Random coding Order (group theory) Erasure Symmetry (geometry) Random variable Decoding methods Independence (probability theory) Computer Science::Information Theory Information Systems Mathematics
Zdroj:	IEEE Transactions on Information Theory. 64:4294-4308
ISSN:	1557-9654 0018-9448
Popis:	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).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::4beaeda5a447579e103a386f43bfc901 https://doi.org/10.1109/tit.2018.2825357 Zobrazit plný text záznamu