Fast algorithms for interactive coding

DOI10.1137/1.9781611973105.32MaRDI QIDQ5741740zbMATH OpenOpenAlexFDO

Authors Zvika Brakerski, Moni Naor

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Fast interactive coding against adversarial noise
• Coding for interactive communication
• Interactive coding for multiparty protocols
• Towards coding for maximum errors in interactive communication
• Towards optimal deterministic coding for interactive communication

Cited in

(13)

• Towards coding for maximum errors in interactive communication
• Palette-alternating tree codes
• scientific article; zbMATH DE number 4176354 (Why is no real title available?)
• Interactive coding for multiparty protocols
• Fast interactive coding against adversarial noise
• Reliable communication over highly connected noisy networks
• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• Simulating noisy channel interaction (extended abstract)
• Noisy interactive quantum communication
• Coding for interactive communication correcting insertions and deletions
• Capacity of interactive communication over erasure channels and channels with feedback
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture

This page was built for publication: Fast algorithms for interactive coding

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