Abstract

Shannon determined that the zero-error capacity of a point-to-point channel whose channel p(y|x) has confusability graph G X|Y is positive if and only if there exist two inputs that are “non-adjacent”, or “non-confusable”. Equivalently, it is non-zero if and only if the independence number of G X|Y is strictly greater than 1. A multi-letter expression for the zero-error capacity of the channel with confusability graph G X|Y is known, and is given by the normalized limit as the blocklength n → 1 of the maximum independent set of the n-fold strong product of G X|Y . This is not generally computable with known methods. In this paper, we look at the zero-error capacity of four multi-user channels: the relay, the multiple-access (MAC), the broadcast (BC), and the interference (IC) channels. As a first step towards finding a multi-letter expression for the capacity of such channels, we find necessary and sufficient conditions under which the zero-error capacity is strictly positive.

Full Text
Paper version not known

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 call

Disclaimer: 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.