Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability

DOI10.1080/00207729508929077zbMath0823.94018OpenAlexW2033320063MaRDI QIDQ4841431

No author found.

Publication date: 6 November 1995

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729508929077

zbMATH Keywords

algorithmsdecodingGolay codehardware implementation

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (2)

Efficient decoding of the \((23, 12, 7)\) Golay code up to five errors ⋮ On the decoding of binary cyclic codes with the Newton identities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic decoding of the (23,12,7) Golay code (Corresp.)
• On high-speed decoding of the (23,12,7) Golay code
• Class of algorithms for decoding block codes with channel measurement information

This page was built for publication: Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability