Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Coding theoryLee distance

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
What happens at the horizon(s) of an extreme black hole?
A massless scalar field exhibits an instability at the event horizon of an extreme black hole. We study numerically the nonlinear… 
2012
2012
Holographic charged fluid with anomalous current at finite cutoff surface in Einstein-Maxwell gravity
A bstractThe holographic charged fluid with anomalous current in Einstein-Maxwell gravity has been generalized from the infinite… 
Highly Cited
2009
Highly Cited
2009
Phase transitions between Reissner-Nordstrom and dilatonic black holes in 4D AdS spacetime
We study Einstein-Maxwell-dilaton gravity models in four-dimensional antide Sitter (AdS) spacetime which admit the Reissner… 
1999
1999
Efficient algorithms for line and curve segment intersection using restricted predicates
Abstract We consider whether restricted sets of geometric predicates support efficient algorithms to solve line and curve segment… 
Highly Cited
1998
Highly Cited
1998
Diagnosability of the Möbius Cubes
  • Jianxi Fan
  • IEEE Trans. Parallel Distributed Syst.
  • 1998
  • Corpus ID: 11489268
The recently introduced interconnection networks, the Mobius cubes, are hypercube variants that have some better properties than… 
Review
1998
Review
1998
On the variance of the number of maxima in random vectors and its applications
Let X = {x1,x2, . . . ,xn} be a set of independent and identically distributed (iid) random vectors in Rd. A point xi = (xi1… 
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… 
Highly Cited
1982
Highly Cited
1982
A device independent graphics imaging model for use with raster devices
In building graphic systems for use with raster devices, it is difficult to develop an intuitive, device independent model of the… 
Highly Cited
1980
Highly Cited
1980
Diagnosis Without Repair for Hybrid Fault Situations
For a new class of fault situations called hybrid fault situations, we consider the fault diagnosing capabilities of systems… 
Highly Cited
1976
Highly Cited
1976
On Models for Diagnosable Systems and Probabilistic Fault Diagnosis
This paper is concerned with automatic fault diagnosis for digital systems with multiple faults. Three problems are treated: 1… 
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)