Title :
On algebraic decoding of the Z4-linear Calderbank-McGuire code
Author :
Rong, Chunming ; Helleseth, Tor ; Lahtonen, Jyrki
Author_Institution :
Dept. of Inf., Bergen Univ., Norway
fDate :
7/1/1999 12:00:00 AM
Abstract :
The quaternary Calderbank-McGuire (see Des., Codes Cryptogr., vol.10, no.2, 1997) code is a Z4-linear code of length 32 which has 237 codewords and a minimum Lee distance of 12. The Gray map of this code is known to be a nonlinear binary (64, 237,12) code. The Z4-linear Calderbank-McGuire code can correct all errors with Lee weight ⩽5. An algebraic decoding algorithm for the code is presented in this paper. Furthermore, we discuss an alternative decoding method which takes advantage of the efficient BCH decoding algorithm
Keywords :
BCH codes; algebraic codes; decoding; error correction codes; linear codes; Gray map; Lee weight; Z4-linear Calderbank-McGuire code; algebraic decoding; algebraic decoding algorithm; code length; codewords; efficient BCH decoding algorithm; error correcting codes; minimum Lee distance; nonlinear binary code; quaternary Calderbank-McGuire code; Binary codes; Decoding; Equations; Error correction codes; Galois fields; Hamming distance; Linear code; Parity check codes; Polynomials; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
