A generalization of the binary Preparata code

  • Authors:
  • A. S. Kuzmin;V. T. Markov;A. A. Nechaev;A. S. Neljubin

  • Affiliations:
  • Center of New Information Technologies, Lomonosov Moscow State University, 119992, Main building of MSU, Vorobjevy Gory, Moscow, Russia;Center of New Information Technologies, Lomonosov Moscow State University, 119992, Main building of MSU, Vorobjevy Gory, Moscow, Russia;Center of New Information Technologies, Lomonosov Moscow State University, 119992, Main building of MSU, Vorobjevy Gory, Moscow, Russia;Center of New Information Technologies, Lomonosov Moscow State University, 119992, Main building of MSU, Vorobjevy Gory, Moscow, Russia

  • Venue:
  • Discrete Applied Mathematics - Special issue: Coding and cryptography
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

A classical binary Preparata code P"2(m) is a nonlinear (2^m^+^1,2^2^(^2^^^m^-^1^-^m^),6)-code, where m is odd. It has a linear representation over the ring Z"4 [Hammons et al., The Z"4-linearity of Kerdock, Preparata, Goethals and related codes, IEEE Trans. Inform. Theory 40(2) (1994) 301-319]. Here for any q=2^l2 and any m such that (m,q-1)=1 a nonlinear code P"q(m) over the field F=GF(q) with parameters (q(@D+1),q^2^(^@D^-^m^),d=3q), where @D=(q^m-1)/(q-1), is constructed. If d=3q this set of parameters generalizes that of P"2(m). The equality d=3q is established in the following cases: (1) for a series of initial admissible values q and m such that q^m