Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Preparata code
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
Abstract. This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers… Expand
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
Highly Cited
1993
Highly Cited
1993
The Nordstrom-Robinson, Kerdock, and (slightly modified) Preparata codes are shown to be linear over Z4 , the integers mod 4… Expand
Review
1991
Review
1991
Computational geometry is concerned with the design and analysis of algorithms for geometrical problems. In addition, other more… Expand
Highly Cited
1989
Highly Cited
1989
This thesis introduces Epsilon Geometry, a framework for the development of robust geometric algorithms using inaccurate… Expand
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
Highly Cited
1987
Highly Cited
1987
We present a new algorithm for finding a maximum matching in a general graph. The special feature of our algorithm is that its… Expand
Highly Cited
1982
Highly Cited
1982
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
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
Highly Cited
1972
Highly Cited
1972
This correspondence describes the construction of complex codes of the form exp i \alpha_k whose discrete circular… Expand