Math @ Duke

Publications [#236049] of Robert Calderbank
Papers Published
 Calderbank, AR; McGuire, G; Kumar, PV; Helleseth, T, Cyclic codes over ℤ_{4} locator polynomials, and newton's identities,
IEEE Transactions on Information Theory, vol. 42 no. 1
(1996),
pp. 217226, ISSN 00189448 [doi]
(last updated on 2018/06/23)
Abstract: Certain nonlinear binary codes contain more codewords 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 ℤ4linear codes with length 2m (m, odd) and size 22m+15m2. The Gray image of the code of length 32 is the best (64, 237) 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 threeerrorcorrecting BCH codes by Hensel lifting. The Gray image of the Hensel lift of the threeerrorcorrecting BCH code of length 32 is the best (64, 232) code that is presently known. This code also determines an extremal 32dimensional even unimodular lattice. © 1996 IEEE.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

