Highly resilient correctors for polynomials
From MaRDI portal
Publication:1199875
DOI10.1016/0020-0190(92)90195-2zbMath0767.68075OpenAlexW1970056983MaRDI QIDQ1199875
Publication date: 17 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90195-2
Specification and verification (program logics, model checking, etc.) (68Q60) Polynomials over finite fields (11T06) General topics in the theory of software (68N01) Theory of software (68N99)
Related Items (26)
Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213] ⋮ A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ On the hardness of computing the permanent of random matrices ⋮ On the Error-Correcting Radius of Folded Reed–Solomon Code Designs ⋮ Generalized Gabidulin codes over fields of any characteristic ⋮ Decoding of Reed Solomon codes beyond the error-correction bound ⋮ Average-case intractability vs. worst-case intractability ⋮ Unnamed Item ⋮ Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes ⋮ Erasures versus errors in local decoding and property testing ⋮ Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks ⋮ Relations between average-case and worst-case complexity ⋮ Computing the partition function of the Sherrington-Kirkpatrick model is hard on average ⋮ Non-interactive proofs of proximity ⋮ Self-correcting for function fields of finite transcendental degree ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ Pseudorandom generators without the XOR lemma ⋮ Unnamed Item ⋮ Exponential lower bound for 2-query locally decodable codes via a quantum argument ⋮ Optimal Rate List Decoding via Derivative Codes ⋮ Reconstructing Algebraic Functions from Mixed Data ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Power error locating pairs ⋮ An analysis of Monte Carlo algorithm for estimating the permanent ⋮ Scalable secure storage when half the system is faulty ⋮ Local correctability of expander codes
Cites Work
This page was built for publication: Highly resilient correctors for polynomials
