DocumentCode :
941155
Title :
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
Author :
Conway, John H. ; Sloane, N. J A
Volume :
32
Issue :
1
fYear :
1986
fDate :
1/1/1986 12:00:00 AM
Firstpage :
41
Lastpage :
50
Abstract :
Two kinds of algorithms are considered. 
If *** is a binary code of length 
, a "soft decision" decoding algorithm for *** changes an arbitrary point of 
into a nearest codeword (nearest in Euclidean distance). 
Similarly, a decoding algorithm for a lattice 
in changes an arbitrary point of into a closest lattice point. Some general methods are given for constructing such algorithms, ami are used to obtain new and faster decoding algorithms for the Gosset lattice 
, the Golay code the Leech lattice.
If *** is a binary code of length , a "soft decision" decoding algorithm for *** changes an arbitrary point of into a nearest codeword (nearest in Euclidean distance). Similarly, a decoding algorithm for a lattice in changes an arbitrary point of into a closest lattice point. Some general methods are given for constructing such algorithms, ami are used to obtain new and faster decoding algorithms for the Gosset lattice , the Golay code the Leech lattice.Keywords :
Coding/decoding; Golay coding; Binary codes; Channel coding; Decoding; Laboratories; Lattices; Mathematics; Reflection; Statistics;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1986.1057135
Filename :
1057135
Link To Document :
