Title :
Convolutional tree codes for multiple access channels (Corresp.)
fDate :
5/1/1977 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1977.1055702
