A permutation decoding of the (24, 12, 8) Golay code (Corresp.)

DOI10.1109/TIT.1983.1056726zbMath0512.94010OpenAlexW1975177438MaRDI QIDQ3657907

Jacques Wolfmann

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1983.1056726

zbMATH Keywords

Golay codeminimal setpermutation decoding method

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (8)

Partial permutation decoding for binary linear Hadamard codes ⋮ A group algebra construction of binary even self dual codes ⋮ A lookup table decoding of systematic \((47, 24, 11)\) quadratic residue code ⋮ Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes ⋮ On the existence of PD-sets: algorithms arising from automorphism groups of codes ⋮ Codes from multipartite graphs and minimal permutation decoding sets ⋮ Niemeier lattices and Type II codes over \(\mathbb{Z}_4\) ⋮ A class of doubly even self dual binary codes

This page was built for publication: A permutation decoding of the (24, 12, 8) Golay code (Corresp.)