Decoding by local optimization

The maximum likelihood decoding problem for linear binary (n,k) codes is reformulated as a continuous optimization problem in a k -dimensional solid cube. We obtain a near optimum solution of this problem by use of a simple gradient local optimization algorithm. Computer simulation results are presented for the (21,11) projective geometry code and the (47,23) quadratic-residue code.