Loading [MathJax]/extensions/TeX/ieee_stixext.js
Decoding by local optimization (Corresp.) | IEEE Journals & Magazine | IEEE Xplore

Decoding by local optimization (Corresp.)


Abstract:

The maximum likelihood decoding problem for linear binary(n,k)codes is reformulated as a continuous optimization problem in ak-dimensional solid cube. We obtain a near op...Show More

Abstract:

The maximum likelihood decoding problem for linear binary(n,k)codes is reformulated as a continuous optimization problem in ak-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.
Published in: IEEE Transactions on Information Theory ( Volume: 29, Issue: 5, September 1983)
Page(s): 740 - 743
Date of Publication: 30 September 1983

ISSN Information:


References

References is not available for this document.