DocumentCode
926685
Title
Convolutional tree codes for multiple access channels (Corresp.)
Author
Ohkubo, Motoaki
Volume
23
Issue
3
fYear
1977
fDate
5/1/1977 12:00:00 AM
Firstpage
397
Lastpage
399
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
Convolutional codes; Multiple-access communications; Viterbi decoding; Block codes; Capacity planning; Convolutional codes; Error probability; Maximum likelihood decoding; Memoryless systems; Network address translation; Shift registers; Upper bound; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1977.1055702
Filename
1055702
Link To Document