Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,118,102 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
(opens in a new tab)
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.
2013
2013
Late-time tails in extremal Reissner-Nordstrom spacetime
A. Ori
2013
Corpus ID: 118525751
This note discusses the late-time decay of perturbations outside extremal Reissner-Nordstrom black hole. We consider individual…
Expand
2010
2010
Area spectrum of the d-dimensional Reissner–Nordström black hole in the small charge limit
A. López-Ortega
2010
Corpus ID: 118715603
A conjecture by Hod states that for the black hole horizon the spacing of its area spectrum is determined by the asymptotic value…
Expand
2010
2010
Gravitational lensing of stars orbiting Sgr A* as a probe of the black hole metric in the Galactic center
A. Bin-Nun
2010
Corpus ID: 122399121
We show that a possible astrophysical experiment, detection of lensed images of stars orbiting close to Sgr A*, can provide…
Expand
2009
2009
Oralni hipoglikemizantni lijekovi u liječenju šećerne bolesti
Vanja Zjačić-Rotkvić
2009
Corpus ID: 57524755
Oralni hipoglikemizantni lijekovi (OHL) koriste se u liječenju šećerne bolesti tipa 2, kada se osnovnim principima liječenja…
Expand
2004
2004
On Components of Preparata Codes
N. Tokareva
Problems of Information Transmission
2004
Corpus ID: 1126784
The paper considers the interrelation between i-components of an arbitrary Preparata-like code P and i-components of a perfect…
Expand
Highly Cited
1994
Highly Cited
1994
Incremental Delaunay Triangulation
Dani Lischinski
Graphics gems
1994
Corpus ID: 117121484
1992
1992
An optimal algorithm for the maximum two-chain problem
R. Lou
,
M. Sarrafzadeh
,
D. T. Lee
ACM-SIAM Symposium on Discrete Algorithms
1992
Corpus ID: 15108236
Given a point set p, a chain is a subset C C p of points in which for any two points one is dominated by the other. A two-chain…
Expand
Highly Cited
1980
Highly Cited
1980
Diagnosis Without Repair for Hybrid Fault Situations
S. Mallela
,
G. Masson
IEEE transactions on computers
1980
Corpus ID: 25569833
For a new class of fault situations called hybrid fault situations, we consider the fault diagnosing capabilities of systems…
Expand
Review
1978
Review
1978
A survey of algorithms and data structures for range searching
J. Bentley
,
J. Friedman
1978
Corpus ID: 34258564
An important problem in database systems is answering queries quickly. This paper surveys a number of algorithms for efficiently…
Expand
Highly Cited
1975
Highly Cited
1975
An Approach to the Diagnosability Analysis of a System
F. Allan
,
T. Kameda
,
S. Toida
IEEE transactions on computers
1975
Corpus ID: 23072083
System diagnosis is investigated along the line of a pioneering work by Preparata et al. and motivated by a recent work of Hakimi…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE