A new upper bound to the throughput of a multi-access broadcast channel
- 1 May 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 28 (3), 402-405
- https://doi.org/10.1109/tit.1982.1056510
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Information of partitions with applications to random access communicationsIEEE Transactions on Information Theory, 1982
- On the capacity of infinite population multiple access protocolsIEEE Transactions on Information Theory, 1982
- Bounds on the performance of protocols for a multiple-access broadcast channelIEEE Transactions on Information Theory, 1981
- Collision-Resolution Algorithms and Random-Access CommunicationsPublished by Springer Science and Business Media LLC ,1981
- Bounds on the Utilization of Aloha-Like Multiple-Access Broadcast ChannelsPublished by Defense Technical Information Center (DTIC) ,1980
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979