Cyclic codes over ℤ4 locator polynomials, and newton's identities

Certain nonlinear binary codes contain more code-words than any comparable linear code presently known. These include the Kerdock and Preparata codes that can be very simply constructed as binary images, under the Gray map, of linear codes over ℤ4 that are defined by means of parity checks involving Galois rings. This paper describes how Fourier transforms on Galois rings and elementary symmetric functions can be used to derive lower bounds on the minimum distance of such codes. These methods and techniques from algebraic geometry are applied to find the exact minimum distance of a family of ℤ4-linear codes with length 2^m (m, odd) and size 2^2m+1-5m-2. The Gray image of the code of length 32 is the best (64, 2³⁷) code that is presently known. This paper also determines the exact minimum Lee distance of the linear codes over ℤ4 that are obtained from the extended binary two- and three-error-correcting BCH codes by Hensel lifting. The Gray image of the Hensel lift of the three-error-correcting BCH code of length 32 is the best (64, 2³²) code that is presently known. This code also determines an extremal 32-dimensional even unimodular lattice. © 1996 IEEE.

Duke Scholars

Author Robert Calderbank Computer Science