By Topic

A Gilbert bound for periodic binary convolutional codes

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 Gilbert bound for periodic binary convolutional (PBC) codes is established. This bound shows that regardless of previous decoding decisions any fraction of errors less than \alpha /2 can be corrected in a constraint length by some PBC code if the constraint length is sufficiently large and R , the code rate, is less than [1 - H(\alpha )]/2, 0 \leq \alpha < frac{1}{2} .

Published in:

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