Decoding the Golay code with Venn diagrams

A decoding algorithm, based on Venn diagrams, for decoding the (23, 12, 7) Golay code is presented. The decoding algorithm is based on the design properties of the parity sets of the code. As for other decoding algorithms for the Golay code, decoding can be easily done by hand. >

[1]  Daniel M. Gordon.  Minimal permutation sets for decoding the binary Golay codes , 1982, IEEE Trans. Inf. Theory.

[2]  Vera Pless,et al.  Decoding the Golay codes , 1986, IEEE Trans. Inf. Theory.

[3]  Robert J. McEliece,et al.  The reliability of computer memories , 1985 .

[4]  Michele Elia,et al.  Algebraic decoding of the (23, 12, 7) Golay code , 1987, IEEE Trans. Inf. Theory.

[5]  Jacques Wolfmann.  A permutation decoding of the (24, 12, 8) Golay code , 1983, IEEE Trans. Inf. Theory.

[6]  Gustav Solomon,et al.  A Golay puzzle , 1983, IEEE Trans. Inf. Theory.