Tight bounds for stream decodable error-correcting codes
From MaRDI portal
Cites work
- 1-pass relative-error L_p-sampling with applications
- 3-query locally decodable codes of subexponential length
- A characterization of the capacity of online (causal) binary channels
- A Framework for Adversarially Robust Streaming Algorithms
- A Mathematical Theory of Communication
- Coding for interactive communication
- Coding for interactive communication: a survey
- Counting large numbers of events in small registers
- Error detecting and error correcting 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
- Hardness amplification via space-efficient direct products
- High-rate codes with sublinear-time decoding
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- Linear-time encodable and decodable error-correcting codes
- List decoding algorithms for certain concatenated codes
- Locally decodable codes
- Matching vector codes
- Optimal approximations of the frequency moments of data streams
- Optimal Coding for Streaming Authentication and Interactive Communication
- Optimal rate code constructions for computationally simple channels
- Pseudorandom generators without the XOR lemma (extended abstract)
- Quasilinear time list-decodable codes for space bounded channels
- Verifying and decoding in constant depth
This page was built for publication: Tight bounds for stream decodable error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296762)
