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

Fingerprint

communications
Entropy
Throughput
Communication
conflict resolution
entropy
broadcast
efficiency

ASJC Scopus subject areas

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

Cite this

Information of Partitions with Applications to Random Access Communications. / Hajek, Bruce E.

In: IEEE Transactions on Information Theory, Vol. 28, No. 5, 09.1982, p. 691-701.

Research output: Contribution to journalArticle

@article{b2399703ea67473988b5d6989b4db052,
title = "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 that single-interval conflict resolution algorithms may not achieve maximum efficiency.",
author = "Hajek, {Bruce E.}",
year = "1982",
month = "9",
doi = "10.1109/TIT.1982.1056551",
language = "English (US)",
volume = "28",
pages = "691--701",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Information of Partitions with Applications to Random Access Communications

AU - Hajek, Bruce E.

PY - 1982/9

Y1 - 1982/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0020180463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020180463&partnerID=8YFLogxK

U2 - 10.1109/TIT.1982.1056551

DO - 10.1109/TIT.1982.1056551

M3 - Article

AN - SCOPUS:0020180463

VL - 28

SP - 691

EP - 701

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

ER -