Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel (Corresp.)

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.