Minimum-hamming-distance decoding of single-generator binary convolutional codes

Several structural and distance properties of the class of codes are derived and utilized in developing a decoding algorithm. Thresholds are determined from distance properties of the codes. Further properties of the codes, under the conditions of the algorithm, are utilized to reduce the number of path comparisons required to ensure minimum distance decoding. Simulation results show that the choice of generator sequence has a marked effect on the ability of the decoder to recover after an error is made