Error probability for repeat request systems with convolutional codes

A new decoding algorithm based on the modified Viterbi algorithm for repeat request systems is considered. A new asymptotic error probability bound is derived. It is shown that the error exponent for convolutional coding can be related to the exponent for block coding by a graphical method known as inverse concatenation construction.<
>