Abstract:
An algorithm for list decoding of convolutional codes is proposed. The asymptotic tradeoff between decoding error probability and decoder complexity with that attainable in sequential decoding. Examples of codes are given for which the proposed decoding method produces better relationships than the Viterbi algorithm.