Palette-alternating tree codes

DOI10.4230/LIPICS.CCC.2020.11MaRDI QIDQ5092459zbMATH OpenOpenAlexFDO

Authors Gil Cohen, Shahar Samocha

Publication date 21 July 2022

Full work available at URL https://dblp.uni-trier.de/db/conf/coco/coco2020.html#CohenS20

zbMATH Keywords

coding theoryinteractive coding schemetree codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A coding theorem for distributed computation
• Coding for interactive communication
• Coding for Interactive Communication Correcting Insertions and Deletions
• Coding for interactive communication: a survey
• Communication Complexity
• Deterministic coding for interactive communication
• Efficient and Explicit Coding for Interactive Communication
• Efficient Coding for Interactive Communication
• Explicit binary tree codes with polylogarithmic size alphabet
• Fast algorithms for interactive coding
• Fast interactive coding against adversarial noise
• scientific article; zbMATH DE number 1256711 (Why is no real title available?)
• Interactive channel capacity
• Interactive coding for multiparty protocols
• Linear tree codes and the problem of explicit constructions
• On decoding Cohen-Haeupler-Schulman tree codes
• Optimal error rates for interactive coding. I: Adaptivity and other settings
• Optimal Interactive Coding for Insertions, Deletions, and Substitutions
• Reliable communication over highly connected noisy networks
• Toward coding for maximum errors in interactive communication
• Towards coding for maximum errors in interactive communication
• Towards deterministic tree code constructions
• Tree codes and a conjecture on exponential sums

This page was built for publication: Palette-alternating tree codes

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