Interactive communication with unknown noise rate
From MaRDI portal
Publication:1641020
DOI10.1016/j.ic.2018.02.018zbMath1403.94012arXiv1504.06316OpenAlexW2790390012MaRDI QIDQ1641020
Mahnush Movahedi, Jared Saia, Thomas P. Hayes, Maxwell Young, Varsha Dani
Publication date: 14 June 2018
Published in: Information and Computation, Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06316
Related Items
Interactive communication with unknown noise rate, Distributed computations in fully-defective networks, Bankrupting Sybil despite churn, A resource-competitive jamming defense, Efficient and competitive broadcast in multi-channel radio networks
Cites Work
- Unnamed Item
- A Mathematical Theory of Communication
- Competitive throughput in multi-hop wireless networks despite adaptive jamming
- An improvement of the tree code construction
- Interactive communication with unknown noise rate
- Towards deterministic tree code constructions
- Making evildoers pay
- Competitive and fair throughput for co-existing networks under adversarial interference
- A jamming-resistant MAC protocol for single-hop wireless networks
- Conflict on a communication channel
- Breathe before speaking
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Tree codes and a conjecture on exponential sums
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Polynomial Codes Over Certain Finite Fields
- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
- Error Detecting and Error Correcting Codes
- Error-Correcting Codes for Automatic Control
- Deterministic coding for interactive communication
- Optimal error rates for interactive coding I
- Towards coding for maximum errors in interactive communication
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Efficient and Explicit Coding for Interactive Communication
- Fast Algorithms for Interactive Coding
- Optimal Coding for Streaming Authentication and Interactive Communication
