Time and space efficient deterministic list decoding
From MaRDI portal
Cites work
- A brief history of the development of error correcting codes
- A note on the decoding complexity of error-correcting codes
- A primer on pseudorandom generators
- Algebraic soft-decision decoding of reed-solomon codes
- Algorithmic Results in List Decoding
- Amplification and derandomization without slowdown
- Code-based cryptography
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs
- Constant-round interactive proofs for delegating computation
- Decoding of Reed Solomon codes beyond the error-correction bound
- Delegating computation: interactive proofs for muggles
- Derandomization with minimal memory footprint
- Efficient zero-knowledge authentication based on a linear algebra problem MinRank
- Endcoding Complexity Versus Minimum Distance
- Error detecting and error correcting codes
- Expander codes
- Explicit time and space efficient encoders exist only with random access
- Hardness vs randomness, revised: uniform, non-black-box, and instance-wise
- How to share a secret
- scientific article; zbMATH DE number 1263215 (Why is no real title available?)
- scientific article; zbMATH DE number 1559564 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- Linear time encodable and list decodable codes
- Nearly optimal pseudorandomness from hardness
- New direct-product testers and 2-query PCPs
- On Obtaining Pseudorandomness from Error-Correcting Codes
- On the efficiency of local decoding procedures for error-correcting codes
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Pseudo-random generators for all hardnesses
- Pseudorandom generators without the XOR lemma
- Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost
- Simple extractors for all min-entropies and a new pseudorandom generator
- Some optimal inapproximability results
- Sub-constant error low degree test of almost-linear size
- The Minimum Distance of Turbo-Like Codes
- Two-query PCP with subconstant error
This page was built for publication: Time and space efficient deterministic list decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445561)