A Derivation of the Asymptotic Random-Coding Prefactor
arXiv:1306.6203
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ğ and Wagner is given, and the result is extended to the setting of mismatched decoding.
arXiv commentPublished at Allerton Conference 2013. (v3) Final version uploaded