One-weight Z4-linear codes


Claude Carlet
GREYC, Université de Caen
and
INRIA, projet CODES
BP 105
78153 Le Chesnay Cedex, France
Claude.Carlet@inria.fr

International conference on Coding Theory, Cryptography and Related Areas, LNCS
Springer-Verlag, to appear

Abstract

For every ordered pair of nonnegative integers (k1,k2), there exists a unique (up to equivalence) one-weight Z4-linear code of type 4k1 2k2. We derive an upper bound and a lower bound on the greatest minimum distance between some one-weight Z4-linear codes of type 4k and the Reed-Muller code of order 1 and same length.