Coding for interactive communication correcting insertions and deletions

DOI10.4230/LIPICS.ICALP.2016.61MaRDI QIDQ4598200zbMATH OpenFDO

Authors Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky

Publication date 19 December 2017

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2016.61

zbMATH Keywords

codingedit distanceinteractive communication

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• Coding for interactive communication
• Synchronization strings: list decoding for insertions and deletions
• Towards optimal deterministic coding for interactive communication
• Fast algorithms for interactive coding

Cited in

(10)

• Interactive non-malleable codes
• Towards deterministic tree code constructions
• Coding for interactive communication
• scientific article; zbMATH DE number 605666 (Why is no real title available?)
• 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
• Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
• Efficient error-correcting codes for sliding windows

This page was built for publication: Coding for interactive communication correcting insertions and deletions

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