Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
Authors:
- T. KasamiTKT. Kasami
- Shu LinSLShu Lin
- V. WeiVWV. Wei
- S. YamamuraSYS. Yamamura
- 1 January 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (1) , 114-130
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- N-user trellis coding for a class of multiple-access channels (Corresp.)IEEE Transactions on Information Theory, 1981
- Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder ChannelIBM Journal of Research and Development, 1980
- Coding for T-user multiple-access channelsIEEE Transactions on Information Theory, 1979
- Binary convolutional codes for a multiple-access channel (Corresp.)IEEE Transactions on Information Theory, 1979
- Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs (Corresp.)IEEE Transactions on Information Theory, 1978
- Decoding of lineardelta-decodable codes for a multiple- access channel (Corresp.)IEEE Transactions on Information Theory, 1978
- 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
- An upper bound for codes in a two-access binary erasure channel (Corresp.)IEEE Transactions on Information Theory, 1978
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977