Distance distribution of binary codes and the error probability of decoding
| dc.creator | Barg, Alexander | |
| dc.creator | McGregor, Andrew | |
| dc.date | 2004-07-04 | |
| dc.date | 2005-07-29 | |
| dc.date.accessioned | 2026-07-07T08:17:41Z | |
| dc.date.available | 2026-07-07T08:17:41Z | |
| dc.description | We address the problem of bounding below the probability of error under maximum likelihood decoding of a binary code with a known distance distribution used on a binary symmetric channel. An improved upper bound is given for the maximum attainable exponent of this probability (the reliability function of the channel). In particular, we prove that the ``random coding exponent'' is the true value of the channel reliability for code rate $R$ in some interval immediately below the critical rate of the channel. An analogous result is obtained for the Gaussian channel. | |
| dc.description | 16 pages, 3 figures. Submitted to IEEE Transactions on Information Theory. The revision was done for a final journal version (it may still be different from the published version) | |
| dc.identifier | https://arxiv.org/abs/cs/0407011 | |
| dc.identifier | http://arxiv.org/abs/cs/0407011 | |
| dc.identifier | IEEE Transactions on Information Theory vol. 51, no. 12, pp. 4237-4246 (2005). | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134179 | |
| dc.subject | Information Theory | |
| dc.title | Distance distribution of binary codes and the error probability of decoding | |
| dc.type | text |