Cart (Loading....) | Create Account
Close category search window

Binary convolutional codes 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
$31 $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

2 Author(s)

Binary convolutional (linear) code pairs are investigated for use on the two-user adder channel. Maximum likelihood decoding is discussed, and a two-user decoding trellis is defined. The L-free distance of a convolutional code pair is defined and shown to be equal to the free distance of the mod-2 sum of the two single-user codes. It follows that the code pair is uniquely decodable if and only if the mod-2 sum code has an inverse, and that the code pair is subject to catastrophic error propagation if and only if the mod-2 sum code is catastrophic. These results also imply that no uniquely decodable binary convolutional (linear) code pairs exist with a rate sum above time sharing.

Published in:

Information Theory, IEEE Transactions on  (Volume:25 ,  Issue: 1 )

Date of Publication:

Jan 1979

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.