Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,629,587 papers from all fields of science
Search
Sign In
Create Free Account
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
Create Alert
Alert
Related topics
Related topics
3 relations
Coding theory
Lee distance
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
Distance-based outliers: algorithms and applications
E. Knorr
,
R. Ng
,
V. Tucakov
The VLDB Journal
2000
Corpus ID: 11707259
Abstract. This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers…
Expand
Highly Cited
1994
Highly Cited
1994
The Z4-linearity of Kerdock, Preparata, Goethals, and related codes
A. R. Hammons
,
P. V. Kumar
,
A. Calderbank
,
N. Sloane
,
P. Solé
IEEE Trans. Inf. Theory
1994
Corpus ID: 7667081
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
A linear construction for certain Kerdock and Preparata codes
A. Calderbank
,
A. R. Hammons
,
P. V. Kumar
,
N. Sloane
,
P. Solé
ArXiv
1993
Corpus ID: 3132715
The Nordstrom-Robinson, Kerdock, and (slightly modified) Preparata codes are shown to be linear over Z4 , the integers mod 4…
Expand
Highly Cited
1993
Highly Cited
1993
A Clustering-Based Optimization Algorithm in Zero-Skew Routings
M. 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
Review
1991
Review
1991
Voronoi diagrams—a survey of a fundamental geometric data structure
F. Aurenhammer
CSUR
1991
Corpus ID: 4613674
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
Epsilon geometry: building robust algorithms from imprecise computations
D. Salesin
,
J. Stolfi
,
L. Guibas
SCG '89
1989
Corpus ID: 14515561
This thesis introduces Epsilon Geometry, a framework for the development of robust geometric algorithms using inaccurate…
Expand
Highly Cited
1988
Highly Cited
1988
Coset codes-II: Binary lattices and related codes
G. Forney
IEEE Trans. Inf. Theory
1988
Corpus ID: 8317128
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
1982
Highly Cited
1982
A theorem on polygon cutting with applications
B. 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
Highly Cited
1974
Highly Cited
1974
Characterization of Connection Assignment of Diagnosable Systems
S. Hakimi
,
A. Amin
IEEE Transactions on Computers
1974
Corpus ID: 41012797
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
Polyphase codes with good periodic correlation properties (Corresp.)
David C. Chu
IEEE Trans. Inf. Theory
1972
Corpus ID: 28467583
This correspondence describes the construction of complex codes of the form exp i \alpha_k whose discrete circular…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE