Abstract
A memoryless channel with a matrix of transaction probabilities $P = \{ P_{ij} \} $ is considered such that any row of the matrix P is a permutation of any other row and any column is a permutation of any other column. It is supposed that $2^{nH} $ possible messages are to be transmitted with the help of words consisting of n symbols. The asymptotic behavior of the error probability for the optimal code is investigated as is the asymptotic behavior of the expectation of the error probability of the randomly chosen code.
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.
