Information of Partitions with Applications to Random Access Communications

Research output: Contribution to journalArticle

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 that single-interval conflict resolution algorithms may not achieve maximum efficiency.

Original languageEnglish (US)
Pages (from-to)691-701
Number of pages11
JournalIEEE Transactions on Information Theory
Volume28
Issue number5
DOIs
StatePublished - Sep 1982

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Information of Partitions with Applications to Random Access Communications'. Together they form a unique fingerprint.

  • Cite this