Title :
Cover positions and decoding complexity of the Golay code, using an extended Kasami algorithm
Author :
Ho, Hai Pang ; Sweeney, Peter
Author_Institution :
Commun. Syst. Res., Surrey Univ., Guildford, UK
Abstract :
This paper compares the complexity of an extended Kasami (1964) algorithm with three other algorithms for the Golay code. A nonmathematical method is described to determine the best cover positions. This leads to a result different from the Kasami algorithm and significantly reduces the decoding complexity.
Keywords :
Golay codes; computational complexity; decoding; Golay code; cover positions; decoding complexity reduction; extended Kasami algorithm; nonmathematical method; Decoding; Error correction; Error correction codes; Pattern analysis; Polynomials;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/4234.736173
