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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
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
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 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
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
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
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
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
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
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
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?