Interactive Communication of Balanced Distributions and of Correlated Files
From MaRDI portal
Recommendations
Cited in
(18)- A probabilistic algorithm for updating files over a communication link
- Protocols for asymmetric communication channels
- On Slepian-Wolf theorem with interaction
- A sharp estimate of the binomial mean absolute deviation with applications
- Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems
- Randomized polynomial time protocol for combinatorial Slepian-Wolf problem
- Semantics of query-driven communication of exact values
- A simple proof of the Ahlswede - Csiszár one-bit theorem (Corresp.)
- Worst Case Nonzero-Error Interactive Communication
- scientific article; zbMATH DE number 1303569 (Why is no real title available?)
- Three results on interactive communication
- On interactive communication
- Coding for computing
- Repeated communication and Ramsey graphs
- Efficient detection of discrepancies in multiple file copies
- On Slepian-Wolf theorem with interaction
- Sample spaces with small bias on neighborhoods and error-correcting communication protocols
- MWS and FWS codes for coordinate-wise weight functions
This page was built for publication: Interactive Communication of Balanced Distributions and of Correlated Files
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302267)