Abstract
Following Root and Varaiya's compound channel coding theorem, we examine the performance limit of codes with finite block length under a compound channel. Although the theorem promises a uniform convergence of the probability of error for individual channels when the block length approaches infinity, the performance can differ considerably with finite block length. The compound channel theorem is applied to the design of universal codes for periodic erasure channels and MIMO channels. Design criteria are proposed in both cases.
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.
