Achieving Shannon capacity for computationally bounded errors
From MaRDI portal
Cites work
- A Mathematical Theory of Communication
- A new approach to information theory
- Binary codes for error detection and correction in a computationally bounded world
- Decoding of Reed Solomon codes beyond the error-correction bound
- Detecting and correcting computationally bounded errors: a simple construction under minimal assumptions
- Error correcting codes that achieve BSC capacity against channels that are poly-size circuits
- Error detecting and error correcting codes
- Expander-based constructions of efficiently decodable codes
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity
- Generalized concatenated codes. Algebraic theory and complexity of realization.
- Improved decoding of Reed-Solomon and algebraic-geometric codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- New constructions of pseudorandom codes
- Optimal Error Correction for Computationally Bounded Noise
- Optimal rate code constructions for computationally simple channels
- Pseudorandom error-correcting codes
- Quasilinear time list-decodable codes for space bounded channels
- Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes
- The pseudorandom oracle model and ideal obfuscation
- Transparent error correcting in a computationally bounded world
This page was built for publication: Achieving Shannon capacity for computationally bounded errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443210)