By Topic

Minimum weight convolutional codewords of finite length (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)

For convolutional codes, thc variation of the minimum distance between nonmerging codewords with the lengths of those codewords is considered for all finite lengths. This is carried out in terms of a new distance parameter for convolutional codes do, the minimum average weight per branch over all cycles. Upper and lower bounds on do for binary convolutional codes of rate 1/n are presented. The tradeoff between d_{o} and the free distance d_{free} is obtained for small memory length codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:22 ,  Issue: 2 )