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.
A Derivation of the Asymptotic Random-Coding Prefactor
Review badges
0 pre-pub reviews
0 post-pub reviews