Towards optimal deterministic coding for interactive communication

DOI10.1137/1.9781611974331.CH135MaRDI QIDQ4575719zbMATH OpenOpenAlexFDO

Authors Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, A. Wigderson

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974331.ch135

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Towards deterministic tree code constructions
• Fast interactive coding against adversarial noise
• Optimal error rates for interactive coding. I: Adaptivity and other settings
• Coding for interactive communication
• Capacity of interactive communication over erasure channels and channels with feedback

Cited in

(25)

• Making asynchronous distributed computations robust to noise
• Interactive non-malleable codes
• Towards deterministic tree code constructions
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Toward coding for maximum errors in interactive communication
• Coding for interactive communication
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• Determining Optimal Rates for Communication for Omniscience
• Bridging the capacity gap between interactive and one-way communication
• Coding for interactive communication correcting insertions and deletions
• Coding for interactive communication: a survey
• scientific article; zbMATH DE number 6866311 (Why is no real title available?)
• What can cryptography do for coding theory? (Abstract)
• Capacity of interactive communication over erasure channels and channels with feedback
• Making Asynchronous Distributed Computations Robust to Channel Noise
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
• On decoding Cohen-Haeupler-Schulman tree codes
• Efficient error-correcting codes for sliding windows
• Interactive coding over the noisy broadcast channel
• Optimal error rates for interactive coding. I: Adaptivity and other settings
• Fast interactive coding against adversarial noise
• Fast algorithms for interactive coding
• Optimal coding for streaming authentication and interactive communication
• The rate of interactive codes is bounded away from 1
• Noisy (binary) searching: simple, fast and correct

This page was built for publication: Towards optimal deterministic coding for interactive communication

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