Efficient Coding for Interactive Communication

DOI10.1109/TIT.2013.2294186MaRDI QIDQ2986511zbMATH OpenOpenAlexFDO

Authors Ran Gelles, Ankur Moitra, Amit Sahai

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

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

Cited in

(13)

• Making asynchronous distributed computations robust to noise
• Reliable communication over highly connected noisy networks
• Noisy beeping networks
• scientific article; zbMATH DE number 6866311 (Why is no real title available?)
• Capacity of interactive communication over erasure channels and channels with feedback
• Making Asynchronous Distributed Computations Robust to Channel Noise
• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
• scientific article; zbMATH DE number 7564410 (Why is no real title available?)
• Palette-alternating tree codes
• Efficient error-correcting codes for sliding windows
• Interactive coding with unbounded noise
• Noisy (binary) searching: simple, fast and correct

This page was built for publication: Efficient Coding for Interactive Communication

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