Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Preparata code

Known as: Extended Preparata code, Nordstrom-Robinson code, Preparata 
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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract. This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers… Expand
  • figure 4
  • figure 5
  • table 1
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
1998
Highly Cited
1998
  • Jianxi Fan
  • IEEE Trans. Parallel Distrib. Syst.
  • 1998
  • Corpus ID: 11489268
The recently introduced interconnection networks, the Mobius cubes, are hypercube variants that have some better properties than… Expand
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… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • Masato Edahiro
  • 30th ACM/IEEE Design Automation Conference
  • 1993
  • Corpus ID: 6402914
A zero-skew routing algorithm with clustering and improvement methods is proposed. This algorithm generates a zero-skew routing… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
For pt.I see ibid., vol.34, no.5, p.1123-51 (1988). The family of Barnes-Wall lattices (including D/sub 4/ and E/sub 8/) of… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
  • Bernard Chazelle
  • 23rd Annual Symposium on Foundations of Computer…
  • 1982
  • Corpus ID: 14232738
Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
 
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1979
Highly Cited
1979
The problem of construction of planar Voronoi diagrams arises in many areas, one of the most important of which is in nearest… Expand
Is this relevant?
Highly Cited
1974
Highly Cited
1974
Preparata, Metze, and Chien [1] gave necessary conditions for identification of all faulty units in a system S capable of… Expand
Is this relevant?