Abstract
Upper bounds on the error probability in channel coding are considered, improving the RCU bound by taking into account events, where the likelihood of the correct codeword is tied with that of some competitors. This bound is compared to various previous results, both qualitatively and quantitatively; it is shown to be the tightest bound with respect to previous bounds with the same computational complexity. With respect to maximal error probability of linear codes, it is observed that when the channel is additive, the derivation of bounds, as well as the assumptions on the admissible encoder and decoder, simplify considerably.
| Original language | English |
|---|---|
| Title of host publication | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |
| Pages | 1725-1729 |
| Number of pages | 5 |
| DOIs | |
| State | Published - 2013 |
| Event | 2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: 7 Jul 2013 → 12 Jul 2013 |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| ISSN (Print) | 2157-8095 |
Conference
| Conference | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |
|---|---|
| Country/Territory | Turkey |
| City | Istanbul |
| Period | 7/07/13 → 12/07/13 |
Bibliographical note
Funding Information:Portions of this research were sponsored by the U. S. National Science Foundation (9734275), the U. S. Army Research Laboratory (under Contract No. DAAL01-98-K-0075 and the MICRA program), and the Defense Advanced Research Projects Agency (MDA972-00-1-0023, through Brown University).