Information of partitions with applications to random access communications
Abstract
The minimum amount of information and the asymptotic minimum amount of entropy of a random partition which separates the points of a Poisson point process are found. Related information theoretic bounds are applied to yield an upper bound to the throughput of a random access broadcast channel. It is shown that more information is needed to separate points by partitions consisting of intervals than by general partitions. This suggests the single-interval conflict resolution algorithms may not achieve maximum efficiency.
- Publication:
-
IEEE Transactions on Information Theory
- Pub Date:
- September 1982
- Bibcode:
- 1982ITIT...28....1H
- Keywords:
-
- Information Theory;
- Multichannel Communication;
- Multiple Access;
- Network Control;
- Random Access;
- Transmission Efficiency;
- Algorithms;
- Communication Networks;
- Entropy;
- Extremum Values;
- Packet Switching;
- Communications and Radar