Short Constraint Length Rate 1/2 "Quick-Look" Codes

Abstract

Quick-look nonsystematic convolutional codes have the property that the information sequence may be recovered from the encoded sequence in straightforward fashion and with a minimum of error amplification. In this concise paper we investigate their relevant characteristics for constraint lengths less than eight and rate and obtain a number of interesting and practically useful results. In particular, for the best of these codes, we derive their free distance and error amplification, their decoded bit error probability when used over the binary symmetric channel in conjunction with Viterbi decoding, and show how they can be employed to measure the channel bit error rate.