Interactive coding with unbounded noise

DOI10.4230/LIPICS.APPROX/RANDOM.2024.43MaRDI QIDQ6920796zbMATH OpenFDO

Authors Eden Fargion, Ran Gelles

Publication date 6 October 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2024.43

zbMATH Keywords

unbounded noiseinteractive codingnoise resiliencedistributed computation with noisy linksrandom erasure-flip noise

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites work

• scientific article; zbMATH DE number 1256711 (Why is no real title available?)
• scientific article; zbMATH DE number 7650863 (Why is no real title available?)
• scientific article; zbMATH DE number 7650355 (Why is no real title available?)
• Capacity of interactive communication over erasure channels and channels with feedback
• Coding for Interactive Communication Correcting Insertions and Deletions
• Coding for interactive communication
• Coding for interactive communication: a survey
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Efficient Coding for Interactive Communication
• Efficient Multiparty Interactive Coding—Part I: Oblivious Insertions, Deletions and Substitutions
• Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise
• Explicit Capacity Approaching Coding for Interactive Communication
• Fast interactive coding against adversarial noise
• Interactive channel capacity
• Interactive channel capacity revisited
• Interactive coding with unbounded noise
• Interactive communication with unknown noise rate
• 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
• Optimal Coding for Streaming Authentication and Interactive Communication
• Optimal Interactive Coding for Insertions, Deletions, and Substitutions
• Optimal error rates for interactive coding. II: Efficiency and list decoding
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• The optimal error resilience of interactive communication over binary channels
• Toward coding for maximum errors in interactive communication

Cited in

(1)

• Interactive coding with unbounded noise

This page was built for publication: Interactive coding with unbounded noise

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