Ben-Aroya et al., 2010 - Google Patents
A note on amplifying the error-tolerance of locally decodable codesBen-Aroya et al., 2010
View PDF- Document ID
- 2640807200511699784
- Author
- Ben-Aroya A
- Efremenko K
- Ta-Shma A
- Publication year
- Publication venue
- Electronic Colloquium on Computational Complexity (ECCC), TR10-134
External Links
Snippet
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setting, works also in the local setting and thus gives a generic, simple way to amplify the error …
- 230000001131 transforming 0 abstract description 11
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Barthe et al. | A probabilistic separation logic | |
| Dvir et al. | Matching vector codes | |
| Beimel et al. | Share conversion and private information retrieval | |
| Gopi et al. | Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound | |
| Günlü et al. | Secure and reliable key agreement with physical unclonable functions | |
| Preskill | Quantum shannon theory | |
| Couteau et al. | Pseudorandom correlation functions from variable-density LPN, revisited | |
| Hayden et al. | Weak decoupling duality and quantum identification | |
| Chiesa et al. | Relaxed locally correctable codes with nearly-linear block length and constant query complexity | |
| Goldreich | On the communication complexity methodology for proving lower bounds on the query complexity of property testing | |
| Albrecht et al. | Quantum augmented dual attack | |
| Ben-Aroya et al. | A note on amplifying the error-tolerance of locally decodable codes | |
| Bergamaschi et al. | Approaching the quantum singleton bound with approximate error correction | |
| de Wolf | A note on quantum algorithms and the minimal degree of epsilon-error polynomials for symmetric functions | |
| Ben-Aroya et al. | Local list decoding with a constant number of queries | |
| Soroceanu et al. | On Multiple Encryption for Public-Key Cryptography | |
| Chen et al. | Error-correcting data structures | |
| Kedlaya et al. | Locally decodable codes from nice subsets of finite fields and prime factors of Mersenne numbers | |
| Barkol et al. | On locally decodable codes, self-correctable codes, and t-private PIR | |
| Gutfreund et al. | The complexity of local list decoding | |
| Boche et al. | Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks | |
| Kopparty et al. | On list recovery of high-rate tensor codes | |
| Choi et al. | Entanglement sharing protocol via quantum error-correcting codes | |
| Singhvi et al. | An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes | |
| Jukna | A nondeterministic space-time tradeoff for linear codes |