Toward coding for maximum errors in interactive communication

DOI10.1109/TIT.2014.2353994MaRDI QIDQ2983369zbMATH OpenFDO

Authors Mark Braverman, Anup Rao

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.2014.2353994

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Towards coding for maximum errors in interactive communication
• Coding for interactive communication: a survey
• Interactive information and coding theory
• Towards optimal deterministic coding for interactive communication
• Optimal error rates for interactive coding. I: Adaptivity and other settings

Cited in

(16)

• Making asynchronous distributed computations robust to noise
• Reliable communication over highly connected noisy networks
• Direct sum fails for zero error average communication
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• Interactive information and coding theory
• 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
• Noisy interactive quantum communication
• Towards coding for maximum errors in interactive communication
• Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption
• The work of Mark Braverman
• Interactive coding with unbounded noise

This page was built for publication: Toward coding for maximum errors in interactive communication

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