DocumentCode
937004
Title
Decoding by local optimization (Corresp.)
Author
Farrell, Kevin ; Rudolph, L. ; Hartmann, C. ; Nielsen, Larry
Volume
29
Issue
5
fYear
1983
fDate
9/1/1983 12:00:00 AM
Firstpage
740
Lastpage
743
Abstract
The maximum likelihood decoding problem for linear binary 
codes is reformulated as a continuous optimization problem in a 
-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 
projective geometry code and the 
quadratic-residue code.
codes is reformulated as a continuous optimization problem in a -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 projective geometry code and the quadratic-residue code.Keywords
Geometry coding; Gradient methods; Linear coding; Residue coding; maximum-likelihood (ML) decoding; Arithmetic; Block codes; Computational geometry; Computer simulation; Information science; Laboratories; Mathematics; Maximum likelihood decoding; Nearest neighbor searches; Solids;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1983.1056724
Filename
1056724
Link To Document