Explicit binary tree codes with polylogarithmic size alphabet

DOI10.1145/3188745.3188928MaRDI QIDQ5230317zbMATH OpenOpenAlexFDO

Authors Gil Cohen, Bernhard Haeupler, Leonard J. Schulman

Publication date 22 August 2019

Published in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3188745.3188928

zbMATH Keywords

explicit constructionssparse polynomialstree codes

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45) Symbolic computation and algebraic computation (68W30)

Recommendations

• Linear tree codes and the problem of explicit constructions
• A New Coding Algorithm for Trees
• On decoding Cohen-Haeupler-Schulman tree codes
• Coding Binary Trees by Words over an Alphabet with Four Letters
• scientific article; zbMATH DE number 475410

Cited in

(6)

• On matrices potentially useful for tree codes
• Towards deterministic tree code constructions
• Tree codes and a conjecture on exponential sums
• Palette-alternating tree codes
• Monotone circuit lower bounds from robust sunflowers
• Linear tree codes and the problem of explicit constructions

This page was built for publication: Explicit binary tree codes with polylogarithmic size alphabet

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