Refinement of the Random Coding Bound

Abstract

The problem of deriving refined bounds on the sub-exponential factor in the random coding bound for discrete memoryless channels is considered. In particular, for independent identically distributed random code ensembles and for rates above the critical rate, we prove that if a regularity condition is satisfied (respectively, not satisfied), then for any… (More)
DOI: 10.1109/TIT.2014.2345374

Topics

Cite this paper

@article{Altug2014RefinementOT, title={Refinement of the Random Coding Bound}, author={Yucel Altug and Aaron B. Wagner}, journal={IEEE Transactions on Information Theory}, year={2014}, volume={60}, pages={6005-6023} }