By Topic

Trellis coding for a multiple-access channel (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)

A general trellis coding scheme has been described previously for error control of L simultaneous users of a discrete memoryless multiple-access channel. A new random coding performance bound for this trellis coding is given in an algebraic form. Since this bound lacks ease of computation, a transfer function bound is derived as a more tractable alternative.

Published in:

IEEE Transactions on Information Theory  (Volume:29 ,  Issue: 4 )