Bounds on the achievable rates of block coding for a memoryless multiple-access channel
- 1 March 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (2) , 187-197
- https://doi.org/10.1109/tit.1978.1055860
Abstract
Block coding for a memoryless two-input single-output multiple-access channel, called a two-user adder channel, is studied. Techniques for constructing codes for this particular channel are presented. Upper and lower bounds on the achievable rates of these codes are derived. These bounds define various two-dimensional regions for the achievable rates of codes for the two-user adder channel.Keywords
This publication has 5 references indexed in Scilit:
- Coding for a multiple-access channelInformation and Control, 1978
- Bounds on the achievable rates of block coding for a memoryless multiple-access channelIEEE Transactions on Information Theory, 1978
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 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