Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
From MaRDI portal
Publication:5002754
DOI10.4230/LIPIcs.ICALP.2018.75zbMath1504.94083arXiv1707.04233OpenAlexW2964155241MaRDI QIDQ5002754
Ellen Vitercik, Amirbehshad Shahrasbi, Bernhard Haeupler
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1707.04233
Theory of error-correcting codes and error-detecting codes (94B99) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Coding theorems (Shannon theory) (94A24) Source coding (94A29)
Related Items
Cites Work
- Unnamed Item
- Towards deterministic tree code constructions
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
- Toward Coding for Maximum Errors in Interactive Communication
- Efficient Coding for Interactive Communication
- Coding for Interactive Communication Correcting Insertions and Deletions
- Synchronization strings
- Synchronization strings: explicit constructions, local decoding, and applications
- Deterministic coding for interactive communication
- Optimal error rates for interactive coding I
- Deletion Codes in the High-Noise and High-Rate Regimes
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
- Efficient and Explicit Coding for Interactive Communication
- Interactive channel capacity
- Fast Interactive Coding against Adversarial Noise
- Fast Algorithms for Interactive Coding
- Optimal Coding for Streaming Authentication and Interactive Communication