By Topic

Convolutional tree codes for multiple access channels (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

IEEE Transactions on Information Theory  (Volume:23 ,  Issue: 3 )