FAQ

Preparata code

Known as: Extended Preparata code, Nordstrom-Robinson code 
In coding theory, the Preparata codes form a class of non-linear double-error-correcting codes. They are named after Franco P. Preparata who first… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2016
01219702016

Related topics

Related topics

3 relations
Coding theoryLee distance

Broader (1)

Error detection and correction

Related mentions per year

Related mentions per year

1954-2018
1960198020002020
Preparata code
Error detection and correction
Coding theory
Lee distance

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
On the minimum distance graph of an extended Preparata code
The minimum distance graph of an extended Preparata code P (m) has vertices corresponding to codewords and edges corresponding to… (More)
Is this relevant?
2009
2009
On weak isometries of Preparata codes
Let C1 and C2 be codes with code distance d. Codes C1 and C2 are called weakly isometric, if there exists a mapping J : C1 → C2… (More)
Is this relevant?
2006
2006
A generalization of the binary Preparata code
A classical binary Preparata codeP2(m) is a nonlinear (2m+1, 22(2 −1−m), 6)-code, wherem is odd. It has a linear representation… (More)
Is this relevant?
1999
1999
Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4
This paper contains results on the generalized Hamming weights for the Goethals and Preparata codes over Z 4 : We give an upper… (More)
Is this relevant?
1999
1999
New infinite families of 3-designs from preparata codes over Z4
We consider t-designs constructed from codewords in the Preparata code ~ ove r 2~4. A new approach is given to prove that the… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1996
1996
A class of Steiner 4-wise balanced designs derived from Preparata codes
The minimum weight codewords in the Preparata code of length n = 4 m are utilized for the construction of an innnite family of… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Modular and p-adic Cyclic Codes
This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo pa and… (More)
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The Z4-linearity of Kerdock, Preparata, Goethals, and related codes
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed… (More)
  • figure 1
  • figure 2
Is this relevant?
1993
1993
A Sharpening of the Johnson Bound for Binary Linear Codes and Nonexistence of Linear Codes with Preparata Parameters
We show for t > 3 the nonexistence of binary [2" 2, 2 t 2t 1, 5] codes. Let a weighted subset of the point set X of the Hamming… (More)
Is this relevant?
1993
1993
A linear construction for certain Kerdock and Preparata codes
The Nordstrom-Robinson, Kerdock and (slightly modified) Preparata codes are shown to be linear over 4, the integers mod 4. The… (More)
Is this relevant?