Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme
C.-L. CHR · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2006
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.