On Random-Coding Union Bounds With and Without Erasures

作者：Haim Eli^*; Kochman Yuval; Erez Uri

来源：IEEE Transactions on Information Theory, 2018, 64(6): 4294-4308.

DOI：10.1109/TIT.2018.2825357

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

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

• 出版日期2018-6