On the asymptotic accuracy of the union bound
| dc.creator | Barg, Alexander | |
| dc.date | 2004-12-24 | |
| dc.date | 2005-04-25 | |
| dc.date.accessioned | 2026-07-07T08:15:17Z | |
| dc.date.available | 2026-07-07T08:15:17Z | |
| dc.description | A new lower bound on the error probability of maximum likelihood decoding of a binary code on a binary symmetric channel was proved in Barg and McGregor (2004, cs.IT/0407011). It was observed in that paper that this bound leads to a new region of code rates in which the random coding exponent is asymptotically tight, giving a new region in which the reliability of the BSC is known exactly. The present paper explains the relation of these results to the union bound on the error probability. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/cs/0412111 | |
| dc.identifier | http://arxiv.org/abs/cs/0412111 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133400 | |
| dc.subject | Information Theory | |
| dc.title | On the asymptotic accuracy of the union bound | |
| dc.type | text |