The noncooperative binary adder channel
- 1 May 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 32 (3) , 365-374
- https://doi.org/10.1109/tit.1986.1057190
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Exponential error bounds for random codes in the arbitrarily varying channelIEEE Transactions on Information Theory, 1985
- A min-max theorem for antijamming group codesIEEE Transactions on Information Theory, 1984
- Spread spectrum communications--Myths and realitiesIEEE Communications Magazine, 1979
- Bounds on the achievable rates of block coding for a memoryless multiple-access channelIEEE Transactions on Information Theory, 1978
- Elimination of correlation in random codes for arbitrarily varying channelsProbability Theory and Related Fields, 1978
- Performance Criteria for Spread Spectrum CommunicationsIEEE Transactions on Communications, 1977
- Game TheoryPublished by Springer Nature ,1977
- Coding for a multiple-access channelIEEE Transactions on Information Theory, 1976
- The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.)IEEE Transactions on Information Theory, 1975
- Coding for a class of unknown channelsIEEE Transactions on Information Theory, 1966