Document Type
Article
Department
Mathematics (HMC)
Publication Date
1981
Abstract
A general model is presented for synchronous protocols that resolve conflicts among message transmissions to a multiple-access broadcast channel. An information-theoretic method is used now to show that if only finitely many types of conflicts can be distinguished by the protocol, utilization of the channel at rates approaching capacity is impossible. A random-coding argument is used to show that if the number of conflicting transmissions can be determined (which requires distinguishing infinitely many types of conflicts) then utilization of the channel at rates arbitrarily close to capacity can be achieved.
Rights Information
© 1981 Institute of Electrical and Electronics Engineers
Terms of Use & License Information
DOI
10.1109/TIT.1981.1056332
Recommended Citation
Pippenger, N., "Bounds on the performance of protocols for a multiple-access broadcast channel," Information Theory, IEEE Transactions on , vol.27, no.2, pp.145,151, Mar 1981. doi: 10.1109/TIT.1981.1056332
