Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise

DOI10.1109/TIT.2022.3160515MaRDI QIDQ5088587zbMATH OpenOpenAlexFDO

Authors Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan

Publication date 13 July 2022

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Cited in

(6)

• NOF-Multiparty Information Complexity Bounds for Pointer Jumping
• Interactive coding over the noisy broadcast channel
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• Information dissemination via broadcasts in the presence of adversarial noise
• Applications of dynamic models for cable-driven parallel robots: a comprehensive review
• Interactive coding with unbounded noise

This page was built for publication: Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise

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