Worst-case interactive communication. I. Two messages are almost optimal

DOI10.1109/18.57210zbMath0738.94002OpenAlexW2138185924MaRDI QIDQ3986480

Alon Orlitsky

Publication date: 27 June 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bbc807794ba7271fe47ea7ea4dff9767c2e7bf6e

zbMATH Keywords

feedbackdata compressioninteractioncommunication complexitysource codingSlepian-Wolf theoreminteractive communication

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29)

Related Items (7)

Interactive Information Complexity ⋮ Interactive Information Complexity ⋮ Worst-case asymmetric distributed function computation ⋮ The communication complexity of functions with large outputs ⋮ Lifting Theorems for Equality ⋮ Protocols for asymmetric communication channels ⋮ On two continuum armed bandit problems in high dimensions

This page was built for publication: Worst-case interactive communication. I. Two messages are almost optimal