A coded ARQ scheme with the generalized Viterbi algorithm
Takeshi Hashimoto · IEEE Transactions on Information Theory · 1993
A coded automatic repeat request (ARQ) scheme based on a generalized Viterbi decoding algorithm is proposed. The scheme utilizes the error propagation, which is commonly observed in reduced-complexity decoding, as a means of error detection. It is shown that a small undetectable error probability is obtained with a small retransmission probability for a discrete memoryless channel, contrary to the conventional convolutionally coded ARQ schemes with Viterbi decoding where a compromise between the retransmission probability and the undetectable error probability must be reached.>