On Construction of the (24,12,8) Golay Codes
Xiao-Hong Peng, Paddy Farrell
TL;DR
This paper presents a new systematic construction method for the (24,12,8) Golay code using product array codes and direct sum operations, simplifying decoding and extending existing frameworks.
Contribution
It introduces a novel construction approach for the Golay code based on product array codes, improving on prior methods and enabling easier decoding.
Findings
Constructed Golay code using product array codes and direct sum.
The resulting code is simple to decode.
Method extends previous construction techniques.
Abstract
Two product array codes are used to construct the (24, 12, 8) binary Golay code through the direct sum operation. This construction provides a systematic way to find proper (8, 4, 4) linear block component codes for generating the Golay code, and it generates and extends previously existing methods that use a similar construction framework. The code constructed is simple to decode.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Coding theory and cryptography · Wireless Communication Networks Research