Explicit list-decodable codes with optimal rate for computationally bounded channels
From MaRDI portal
Publication:2029777
DOI10.1007/s00037-020-00203-wzbMath1483.94076OpenAlexW3122736160MaRDI QIDQ2029777
Publication date: 4 June 2021
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6668/
Analysis of algorithms and problem complexity (68Q25) Other types of codes (94B60) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
- Pseudorandom bits for constant depth circuits
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Pseudorandom generators for space-bounded computation
- Hardness vs randomness
- On the asymptotic behaviour of some towers of function fields over finite fields
- Decoding of Reed Solomon codes beyond the error-correction bound
- Linear-time list recovery of high-rate expander codes
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Randomness is linear in space
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Pseudorandomness for network algorithms
- Optimal Rate Code Constructions for Computationally Simple Channels
- Polylogarithmic independence fools AC 0 circuits
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Combinatorial bounds for list decoding
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Optimal Error Correction for Computationally Bounded Noise
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- Subspace evasive sets
This page was built for publication: Explicit list-decodable codes with optimal rate for computationally bounded channels
