Round-vs-resilience tradeoffs for binary feedback channels
From MaRDI portal
Cites work
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- Binary codes with resilience beyond 1/4 via interaction
- Binary Error-Correcting Codes with Minimal Noiseless Feedback
- Binary interactive error resilience beyond \(1/8\) (or why \((1/2)^3 > 1/8\))
- Coding for interactive communication
- Communication with partial noiseless feedback
- Deterministic coding for interactive communication
- Exponential error bounds for erasure, list, and decision feedback schemes
- scientific article; zbMATH DE number 3970683 (Why is no real title available?)
- scientific article; zbMATH DE number 3555863 (Why is no real title available?)
- scientific article; zbMATH DE number 1256711 (Why is no real title available?)
- scientific article; zbMATH DE number 3282350 (Why is no real title available?)
- Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption
- List decoding algorithms for certain concatenated codes
- List decoding from erasures: bounds and code constructions
- List-Decodable Zero-Rate Codes
- On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback
- Optimal Feedback Communication Via Posterior Matching
- Plotkin bound generalization to the case of multiple packings
- Sequential transmission using noiseless feedback
- The optimal error resilience of interactive communication over binary channels
- Three Thresholds for a Liar
- Voting paradoxes and digraphs realizations
- Why Do Block Length and Delay Behave Differently if Feedback Is Present?
- Zero-Rate Feedback Can Achieve the Empirical Capacity
This page was built for publication: Round-vs-resilience tradeoffs for binary feedback channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296654)
