Optimal Binary Codes for Small Rates of Transmission of Information
Author:
- R. L. DobrushinRDR. L. Dobrushin
- 1 January 1962
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Theory of Probability & Its Applications
- Vol. 7 (2) , 199-204
Abstract
Let us suppose that the input alphabet of a channel consists of two symbols. We consider the optimal method of transmission of N code entries through the channel where the length of transmission is for $n \to \infty $ and $N = {\text{const}}$. Formula (21) gives an asymptotic expression for the optimal probability of error if the transition matrix of the channel is symmetrical in a certain sense.
Keywords
This publication has 4 references indexed in Scilit:
- Foundations of Information TheoryPhysics Today, 1958
- A note on upper bounds for minimum distance codesInformation and Control, 1958
- A Class of Binary Signaling AlphabetsBell System Technical Journal, 1956
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950