Concentration of Random-Coding Error Exponents
View / Open Files
Authors
Truong, LV
Cocco, G
Font-Segura, J
Guillen I Fabregas, A
Publication Date
2021Journal Title
2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings
Conference Name
2021 IEEE Information Theory Workshop (ITW)
ISBN
9781665403122
Publisher
IEEE
Volume
00
Pages
1-5
Type
Conference Object
This Version
AM
Metadata
Show full item recordCitation
Truong, L., Cocco, G., Font-Segura, J., & Guillen I Fabregas, A. (2021). Concentration of Random-Coding Error Exponents. 2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings, 00 1-5. https://doi.org/10.1109/ITW48936.2021.9611426
Abstract
This paper studies the error exponent of i.i.d. randomly generated codes used for transmission over discrete memoryless channels with maximum likelihood decoding. Specifically, this paper shows that the error exponent of a code, defined as the negative normalized logarithm of the probability of error, converges in probability to the typical error exponent. For high rates, the result is a consequence of the fact that the random-coding error exponent and the sphere-packing error exponent coincide. For low rates, instead, the proof of convergence is based on the fact that the union bound accurately characterizes the probability of error.
Sponsorship
European Research Council (725411)
Identifiers
External DOI: https://doi.org/10.1109/ITW48936.2021.9611426
This record's URL: https://www.repository.cam.ac.uk/handle/1810/333878
Statistics
Total file downloads (since January 2020). For more information on metrics see the
IRUS guide.