Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:Mo-PM-1-2
Session:
Number:Mo-PM-1-2.3
Asymptotics of the Random Coding Union Bound
Josep Font-Segura, Alfonso Martinez, Albert Guillen i Fabregas,
pp.125-129
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.Mo-PM-1-2.3
PDF download
Summary:
Saddlepoint approximations and expansions of the random coding union bound are derived for the i.i.d. random coding ensemble. Using the inverse Laplace transform of lattice and strongly non-lattice distributions, our results recover the random coding error exponent and refine the pre-exponential coefficient of the error probability. Explicit characterization of the terms are given for the binary symmetric channel and for the binary input AWGN channel.