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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
