Decoding linear block codes using optimization techniques

We present a new soft-decision decoding algorithm, Modified A* (MA*), that conducts heuristic search through a code tree for a binary (n,k) linear code. MA* improves on the results obtained earlier using Algorithm A*. We also describe the application of the simulated annealing (SA) algorithm to the decoding problem, transformed into a continuous optimisation problem.