By Topic

Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric 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
$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)

An explicit method is given to evaluate Viterbi's union bounds on both the first event error probability and the bit error probability of binary convolutional codes on a binary symmetric channel. These bounds are evaluated for the rate 1/2 code with generators 1 + D + D^{2} and 1 + D^{2} . Comparison is made with the bounds and experimental results of van de Meeberg.

Published in:

IEEE Transactions on Information Theory  (Volume:23 ,  Issue: 3 )