Interactive Communication of Balanced Distributions and of Correlated Files

DOI10.1137/0406043zbMath0795.94002OpenAlexW2044492449MaRDI QIDQ4302267

Alon Orlitsky

Publication date: 14 August 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0406043

zbMATH Keywords

data compressioncommunication complexityinteractive communication

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication, information (94A99) Information theory (general) (94A15) Source coding (94A29)

Related Items (5)

Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem ⋮ A sharp estimate of the binomial mean absolute deviation with applications ⋮ Efficient detection of discrepancies in multiple file copies ⋮ Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems ⋮ Protocols for asymmetric communication channels

This page was built for publication: Interactive Communication of Balanced Distributions and of Correlated Files