By Topic

New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding

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)
K. J. Hole ; Center for Magnetic Recording Res., California Univ., San Diego, La Jolla, CA, USA

Punctured convolutional codes with good performance are reported for rates (n-1)/n with n=5, 6, 7, 8 and constraint lengths k=2, 3, . . ., 6. The tabulated codes are nonsystematic binary convolutional codes with maximum free distance and minimum information weight, for use with soft-decision Viterbi decoding

Published in:

IEEE Transactions on Information Theory  (Volume:34 ,  Issue: 5 )