Title :
On algebraic decoding of the Z4-linear Goethals-like codes
Author_Institution :
Turku Centre for Comput. Sci., Finland
fDate :
9/1/2000 12:00:00 AM
Abstract :
The Z4-linear Goethals-like code of length 2m has 22m+1-3m-2 codewords and minimum Lee distance 8 for any odd integer m⩾3. We present an algebraic decoding algorithm for all Z4-linear Goethals-like codes Ck introduced by Helleseth et al.(1995, 1996). We use Dickson polynomials and their properties to solve the syndrome equations
Keywords :
binary codes; decoding; linear codes; polynomials; Dickson polynomials; Z4-linear Goethals-like codes; algebraic decoding; minimum Lee distance; syndrome equations; Binary codes; Computer science; Decoding; Equations; Galois fields; Parity check codes; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
