For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
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
Publication Date: 2006/08/01
Online ISSN: 1745-1337
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)>>
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.