Abstract
Consider a code of finite size N with code words of length n for a discrete memoryless channel. Suppose the code words are equally probable for transmission and let the maximum likelihood decoding scheme be used for decoding the messages. Dobrushin investigated in details the asymptotic behaviour of the optimum error probability as n→∞ for the case of a binary symmetric channel. Molchanov obtained an asymptotic expression (as n→∞) for the average probability of error for a general (asymmetric) binary channel. Using the method of Dobrushin and and a result of Gallager, an asymptotic expression (as n→∞) for the average probability of error for a general discrete memoryless channel with a binary input alphabet is derived in this paper. However, the results can be easily extended to the case of a general discrete memoryless channel. Some results of Dobrushin are simplified and extended. Properties of the function occuring in the asymptotic expression are discussed. Concurrent with this research, similar results though generalized have been published by Shannon, Gallager and Berlekamp.
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.
