Palette-alternating tree codes

DOI10.4230/LIPIcs.CCC.2020.11OpenAlexW3012971507MaRDI QIDQ5092459

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 theorytree codesinteractive coding scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• Linear tree codes and the problem of explicit constructions
• A coding theorem for distributed computation
• Towards deterministic tree code constructions
• Toward Coding for Maximum Errors in Interactive Communication
• Efficient Coding for Interactive Communication
• Tree codes and a conjecture on exponential sums
• Interactive Coding for Multiparty Protocols
• Coding for interactive communication
• Coding for Interactive Communication Correcting Insertions and Deletions
• Coding for Interactive Communication: A Survey
• Communication Complexity
• On Decoding Cohen-Haeupler-Schulman Tree Codes
• Optimal Interactive Coding for Insertions, Deletions, and Substitutions
• Explicit binary tree codes with polylogarithmic size alphabet
• Deterministic coding for interactive communication
• Optimal error rates for interactive coding I
• Reliable Communication over Highly Connected Noisy Networks
• Towards coding for maximum errors in interactive communication
• Efficient and Explicit Coding for Interactive Communication
• Interactive channel capacity
• Fast Interactive Coding against Adversarial Noise
• Fast Algorithms for Interactive Coding

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