On interactive communication

DOI10.1109/18.567643MaRDI QIDQ4336282zbMATH OpenOpenAlexFDO

Authors Ning Cai, Zhen Zhang, Rudolf Ahlswede

Publication date 26 August 1997

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

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

zbMATH Keywords

abstract sourcesaverage degree boundcommunication complexityhypergraph covering and coloringworst case complexity

Mathematics Subject Classification ID

Hypergraphs (05C65) Communication theory (94A05) Source coding (94A29)

Recommendations

• Three messages are not optimal in worst case interactive communication
• Three results on interactive communication
• Interactive Communication of Balanced Distributions and of Correlated Files

Cited in

(13)

• Communication across viewpoints
• Estimating the mutual interference of two sources in a multiple access channel
• Communication via intermediaries
• A simple proof of the Ahlswede - Csiszár one-bit theorem (Corresp.)
• Estimating with randomized encoding the joint empirical distribution in a correlated source
• scientific article; zbMATH DE number 826048 (Why is no real title available?)
• Repeated communication and Ramsey graphs
• scientific article; zbMATH DE number 1421002 (Why is no real title available?)
• Interactive function computation via polar coding
• Intermittent Communication
• Ning Cai: a tribute to a pioneering scholar in information theory
• Ning Cai's work on communication complexity
• How to communicate efficiently

This page was built for publication: On interactive communication

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