The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate
Information Theory
2020-01-07 v1 math.IT
Abstract
The generalized Poor-Verdu error lower bound for multihypothesis testing is revisited. Its asymptotic expression is established in closed-form as its tilting parameter grows to infinity. It is also shown that the asymptotic generalized bound achieves the error exponent (or reliability function) of the memoryless binary symmetric channel at zero coding rates.
Keywords
Cite
@article{arxiv.2001.01159,
title = {The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate},
author = {Ling-Hua Chang and Po-Ning Chen and Fady Alajaji and Yunghsiang S. Han},
journal= {arXiv preprint arXiv:2001.01159},
year = {2020}
}