Fast Algorithms for Interactive Coding
From MaRDI portal
Publication:5741740
DOI10.1137/1.9781611973105.32zbMath1420.68086OpenAlexW2404094227MaRDI QIDQ5741740
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
Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (8)
Interactive communication with unknown noise rate ⋮ Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions ⋮ List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise ⋮ Reliable communication over highly connected noisy networks ⋮ Capacity of Interactive Communication over Erasure Channels and Channels with Feedback ⋮ Palette-alternating tree codes ⋮ Noisy Interactive Quantum Communication ⋮ Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture
This page was built for publication: Fast Algorithms for Interactive Coding
