Refinement of the Random Coding Bound

DOI10.1109/TIT.2014.2345374MaRDI QIDQ2986085zbMATH OpenOpenAlexFDO

Authors Yücel Altuğ, Aaron B. Wagner

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.6875

Mathematics Subject Classification ID

Source coding (94A29) Other types of codes (94B60)

Abstract: An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not satisfied), then for any $epsilon>0$ a pre-factor of $$ (resp. $O(N^{-frac12})$) is achievable for rates above the critical rate, where $N$ and $R$ is the blocklength and rate, respectively. The extra term $$ is related to the slope of the random coding exponent. Further, the relation of these bounds with the authors' recent refinement of the sphere-packing bound, as well as the pre-factor for the random coding bound below the critical rate, is discussed.

Cited in

(9)

• Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
• Properties of noncommutative Rényi and Augustin information
• The sphere packing bound for memoryless channels
• Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
• A one-parameter refinement of the Razumov-Stroganov correspondence
• Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
• Simple one-shot bounds for various source coding problems using smooth Rényi quantities
• A toolbox for refined information-theoretic analyses
• Recoding-derived bounds for input encoding

This page was built for publication: Refinement of the Random Coding Bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986085)