Capacity of Interactive Communication over Erasure Channels and Channels with Feedback

Related Items (2)

Interactive non-malleable codes ⋮ Unnamed Item

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A Mathematical Theory of Communication
A coding theorem for distributed computation
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
Private Interactive Communication Across an Adversarial Channel
Toward Coding for Maximum Errors in Interactive Communication
Efficient Coding for Interactive Communication
Coding for interactive communication
Small-Bias Probability Spaces: Efficient Constructions and Applications
Simple Constructions of Almost k-wise Independent Random Variables
Towards Optimal Deterministic Coding for Interactive Communication
Bridging the Capacity Gap Between Interactive and One-Way Communication
Coding for Interactive Communication: A Survey
Noisy Interactive Quantum Communication
Deterministic coding for interactive communication
Optimal error rates for interactive coding I
Communication with Partial Noiseless Feedback
Constant-rate coding for multiparty interactive communication is impossible
Reliable Communication over Highly Connected Noisy Networks
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
Efficient and Explicit Coding for Interactive Communication
Interactive channel capacity
Fast Interactive Coding against Adversarial Noise
Fast Algorithms for Interactive Coding
Optimal Coding for Streaming Authentication and Interactive Communication
Optimal Coding for Streaming Authentication and Interactive Communication

This page was built for publication: Capacity of Interactive Communication over Erasure Channels and Channels with Feedback