Bounds on the performance of protocols for a multiple-access broadcast channel

Authors:
N. Pippenger
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

Toward a deterministic polynomial time algorithm with optimal additive query complexity

Theoretical Computer Science
Space-efficient straggler identification in round-trip data streams via newton's identities and invertible bloom filters

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	754.84

Visualization

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.