Three messages are not optimal in worst case interactive communication

DOI10.1109/18.272450MaRDI QIDQ4307265zbMATH OpenOpenAlexFDO

Authors Zhen Zhang, X.-G. Xia

Publication date 4 October 1994

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

Full work available at URL https://doi.org/10.1109/18.272450

zbMATH Keywords

hypergraphcommunication complexityinteractive communicationcoloring interaction

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Three results on interactive communication
• A three-party communication problem
• Worst Case Nonzero-Error Interactive Communication
• A communication problem and directed triple systems
• Optimal multiple message broadcasting in telephone-like communication systems
• Three-Receiver Broadcast Channels With Common and Confidential Messages
• Communication complexity in a 3-computer model
• Communication with multiple senders: an experiment
• Communication Complexity of Simultaneous Messages
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits

Cited in

(6)

• On Slepian-Wolf theorem with interaction
• scientific article; zbMATH DE number 826048 (Why is no real title available?)
• Interactive Communication of Balanced Distributions and of Correlated Files
• Worst-case asymmetric distributed function computation
• scientific article; zbMATH DE number 4191079 (Why is no real title available?)
• Worst Case Nonzero-Error Interactive Communication

This page was built for publication: Three messages are not optimal in worst case interactive communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307265)