The A algorithm is applied to maximum-likelihood soft-decision decodi
ng of binary linear block codes, This paper gives a tutorial on the A
algorithm, compares the decoding complexity with that of exhaustive s
earch and Viterbi decoding algorithms, and presents performance curves
obtained for several codes.