Worst-case interactive communication. II. Two messages are not optimal

DOI10.1109/18.86993zbMath0738.94003OpenAlexW2112263878MaRDI QIDQ3981152

Alon Orlitsky

Publication date: 26 June 1992

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

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

zbMATH Keywords

feedbackdata compressioninteractioncommunication complexitysource codingSlepian-Wolf theoreminteractive communication

Mathematics Subject Classification ID

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

Related Items (4)

Interactive Information Complexity ⋮ Interactive Information Complexity ⋮ The communication complexity of functions with large outputs ⋮ Protocols for asymmetric communication channels

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