A Gilbert bound for periodic binary convolutional codes
Terry J. Wagner · IEEE Transactions on Information Theory · 1968
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/2can be corrected in a constraint length by some PBC code if the constraint length is sufficiently large andR, the code rate, is less than[1 - H(\alpha)]/2, 0 \leq \alpha < \frac{1}{2}.