Decoding of Block Codes Obtained from Convolution Codes

We consider block codes obtained from convolution codes by truncation with “tail biting.” A decoding algorithm is proposed. We show that for these codes the asymptotic tradeoff relationships between error probability and decoding complexity are the same as for convolution codes with Viterbi decoding.