A Derivation of the Asymptotic Random-Coding Prefactor
Information Theory
2013-10-15 v3 math.IT
Abstract
This paper studies the subexponential prefactor to the random-coding bound for a given rate. Using a refinement of Gallager's bounding techniques, an alternative proof of a recent result by Altu\u{g} and Wagner is given, and the result is extended to the setting of mismatched decoding.
Keywords
Cite
@article{arxiv.1306.6203,
title = {A Derivation of the Asymptotic Random-Coding Prefactor},
author = {Jonathan Scarlett and Alfonso Martinez and Albert Guillén i Fàbregas},
journal= {arXiv preprint arXiv:1306.6203},
year = {2013}
}
Comments
Published at Allerton Conference 2013. (v3) Final version uploaded