Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme

Ching-Lung CHR  Szu-Lin SU  Shao-Wei WU  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E89-A   No.8   pp.2235-2238
Publication Date: 2006/08/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e89-a.8.2235
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
(23,  12,  7) binary Golay code,  algebraic decoding scheme,  step-by-step decoding,  computational complexity,  

Full Text: PDF(293KB)>>
Buy this Article

Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using this scheme.