Convolutional tree codes for multiple access channels (Corresp.)
- 1 May 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (3), 397-399
- https://doi.org/10.1109/tit.1977.1055702
Abstract
The decoding algorithm of Viterbi is extended to the case of a memoryless multiple access channel. It is Shown that in the capacity region, the probability of decoding error is bounded from above by a function of the constraint length of the code.Keywords
This publication has 3 references indexed in Scilit:
- The Noisy Channel Coding Theorem for Erasure ChannelsThe American Mathematical Monthly, 1974
- A Coding Theorem for Multiple Access Channels With Correlated SourcesBell System Technical Journal, 1973
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967