Optimal Error Correction for Computationally Bounded Noise
نویسندگان
چکیده
منابع مشابه
Optimal Error Correction Against Computationally Bounded Noise
For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capability is much greater than classically possible. In particular: 1. For binary alphabets, we construct positive-rate coding schemes which are uniquely decodable from a 1/2 − γ error rate for any constant
متن کاملError Correction in the Bounded Storage Model
We initiate a study of Maurer’s bounded storage model (JoC, 1992) in presence of transmission errors and perhaps other types of errors that cause different parties to have inconsistent views of the public random source. Such errors seem inevitable in any implementation of the model. All previous schemes and protocols in the model assume a perfectly consistent view of the public source from all ...
متن کاملOptimal codes for single-error correction, double-adjacent-error detection
In certain memory systems the most common error is a single error and the next most common error is two errors in positions which are stored physically adjacent in the memory. In this correspondence we present optimal codes for recovering from such errors. We correct single errors and detect double adjacent errors. For detecting adjacent errors we consider codes which are byte-organized. In the...
متن کاملError Preserving Correction for CPD and Bounded-Norm CPD
In CANDECOMP/PARAFAC tensor decomposition, degeneracy often occurs in some difficult scenarios, e.g., when the rank exceeds the tensor dimension, or when the loading components are highly collinear in several or all modes, or when CPD does not have an optimal solution. In such the cases, norms of some rank-1 terms become significantly large, and cancel each other. This makes algorithms getting ...
متن کاملQuantum Error Correction in correlated quantum noise
The superiority of quantum computation over conventional computation relies on the fact that a quantumbit (qubit) register can be in the superposition of a very large number of classical computational states. At the same time, maintaining coherence of this highly superpositional state poses also the main obstacle for the realization of a quantum computer. For a small number of qubits this diffi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2070370