Decoding of lineardelta-decodable codes for a multiple- access channel (Corresp.)
Authors:
- T. KasamiTKT. Kasami
- Shu LinSLShu Lin
- 1 September 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (5) , 633-635
Abstract
A scheme is presented for decoding linear\delta-decodable codes for the two-user noisy adder channel that exploits the linearity of the codes and corrects all patterns of\lfloor (\delta - 1)/2 \rflooror fewer transmission errors.Keywords
This publication has 5 references indexed in Scilit:
- Binary convolutional codes for a multiple-access channel (Corresp.)IEEE Transactions on Information Theory, 1979
- 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
- Coding for a multiple-access channelIEEE Transactions on Information Theory, 1976