并集 bound 的渐近精确性
信息论
2007-07-13 v2 math.IT
摘要
在Barg和McGregor (2004, cs.IT/0407011)中，证明了二进制码在二进制对称信道上最大似然解码错误概率的一个新下界。该文观察到，这一下界导致随机编码指数在渐近上严格紧密的新信道速率区域，从而给出BSC可靠性已知精确的新区域。本文阐明了这些结果与并集 bound（error probability）之间的关系。
引用
@article{arxiv.cs/0412111,
title = {On the asymptotic accuracy of the union bound},
author = {Alexander Barg},
journal= {arXiv preprint arXiv:cs/0412111},
year = {2007}
}
备注
10 pages, 3 figures. Presented at the 42nd Annual Allerton Conference on Communication, Control and Computing (Sept. 29 - Oct. 1, 2004). The paper will appear in the conference proceedings. Version 2 differs slightly from the published version and is the latest version of this paper