Error correction for message streams
From MaRDI portal
Cites work
- 1-pass relative-error L_p-sampling with applications
- 3-query locally decodable codes of subexponential length
- A Framework for Adversarially Robust Streaming Algorithms
- A Mathematical Theory of Communication
- An improved data stream summary: the count-min sketch and its applications
- Approximate counting: a detailed analysis
- Binary interactive error resilience beyond \(1/8\) (or why \((1/2)^3 > 1/8\))
- Capacity of interactive communication over erasure channels and channels with feedback
- Coding for interactive communication
- Coding for interactive communication: a survey
- Counting large numbers of events in small registers
- Data stream algorithms for codeword testing (extended abstract)
- Deterministic coding for interactive communication
- Efficient interactive coding against adversarial noise
- Error detecting and error correcting codes
- Extensions of Lipschitz mappings into a Hilbert space
- Fast algorithms for interactive coding
- Finding frequent items in data streams
- Generalized minimum distance decoding
- High-rate codes with sublinear-time decoding
- Highly resilient correctors for polynomials
- scientific article; zbMATH DE number 1256711 (Why is no real title available?)
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- Interactive channel capacity revisited
- Interactive coding with small memory
- List and unique coding for interactive communication in the presence of adversarial noise
- List decoding algorithms for certain concatenated codes
- Locally decodable codes
- Locally testable codes with constant rate, distance, and locality
- Matching vector codes
- Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
- Optimal approximations of the frequency moments of data streams
- Optimal error rates for interactive coding. II: Efficiency and list decoding
- Polynomial Codes Over Certain Finite Fields
- Polynomial fitting of data streams with applications to codeword testing
- The optimal error resilience of interactive communication over binary channels
- Towards coding for maximum errors in interactive communication
- Towards deterministic tree code constructions
- Towards optimal deterministic coding for interactive communication
This page was built for publication: Error correction for message streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296703)
