Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel (Corresp.)
KA Karel Post · IEEE Transactions on Information Theory · 1977
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 rate1/2code with generators1 + D + D^{2}and1 + D^{2}. Comparison is made with the bounds and experimental results of van de Meeberg.