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 .
This paper shows how to construct the optimum Golay code using the generalised array code (GAC) concept. Its importance lies in the systematic combination of the direct sum and GAC construction techniques, and is the culmination of a series of investigations by the authors and others into effective constructions of this type. The practical value of the construction is that it enables fast near-maximum likelihood decoding of the Golay code using regular parallel sub-trellises or Tanner graphs implemented on integrated circuits with reduced chip areas and intra-chip interconnections. RAE_import_type : Journal article RAE_uoa_type : Electrical and Electronic Engineering
