By Topic

A note on asymptotically catastrophic convolutional codes of rate (n-1)/n

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 ; Dept. of Inf., Bergen Univ., Norway

Convolutional codes with rate R=(n-1)/n,n⩾2, are defined in terms of their minimal parity check matrices. The matrices are represented by a binary vector notation introduced by Ytrehus (1992). The upper bounds on ω0 (minimum average weight per branch) are presented. Many classes of rate (n-1)/n convolutional codes are shown to be asymptotically catastrophic

Published in:

IEEE Transactions on Communications  (Volume:45 ,  Issue: 9 )