Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 403-404 |
Number of pages | 2 |
Journal | IEEE Transactions on Information Theory |
Volume | 23 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1977 |