On Maximum Likelihood, Soft Decision Decoding Of Binary (linear) Codes
P.A.H. Bours, N.J.C. Lous, H.C.A. van Tilborg · 2005
Two efficient, maximum likelihood, soft decision decoding algorithms for binary (linear) codes are derived, and compared to known algorithms. The new algorithms do not use a binary tree for considering the possible error patterns corresponding to the received word and for determining the most likely one, but they use a graph that is designed to make a more efficient use of branching and bounding techniques.