DocumentCode :
1538033
Title :
Decoding of the Golay code
Author :
Ma, Jian-feng
Author_Institution :
Dept. of Comput. Sci., Xidian Univ., Xi´´an, China
Volume :
33
Issue :
17
fYear :
1997
fDate :
8/14/1997 12:00:00 AM
Firstpage :
1451
Lastpage :
1452
Abstract :
A decoding algorithm based on revised syndromes to decode the binary (23, 12, 7) Golay code is presented. The algorithm strongly depends on the algebraic properties of the code. For the algorithm, the worst complexity is ~576 mod 2 additions, which is less than that of the algorithms available for the code; the average complexity is approximately 224 mod 2 additions, which is also less than that of the known algorithms for the code
Keywords :
Golay codes; decoding; algebraic properties; binary Golay code; complexity; decoding algorithm; revised syndrome;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19970997
Filename :
621630
Link To Document :
بازگشت