Deterministic coding for interactive communication

DOI10.1145/167088.167279MaRDI QIDQ5248546zbMATH OpenOpenAlexFDO

Authors Leonard J. Schulman

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167279

Mathematics Subject Classification ID

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

Cited in

(15)

• Reliable communication over highly connected noisy networks
• Interactive non-malleable codes
• Interactive Coding for Interactive Proofs
• Capacity of interactive communication over erasure channels and channels with feedback
• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
• Palette-alternating tree codes
• Efficient error-correcting codes for sliding windows
• Noisy interactive quantum communication
• Fast interactive coding against adversarial noise
• The work of Mark Braverman
• The rate of interactive codes is bounded away from 1
• Computation over the noisy broadcast channel with malicious parties
• An improvement of the tree code construction
• Linear tree codes and the problem of explicit constructions

This page was built for publication: Deterministic coding for interactive communication

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