Explicit binary tree codes with polylogarithmic size alphabet

DOI10.1145/3188745.3188928zbMath1427.68141OpenAlexW2809603656MaRDI QIDQ5230317

Gil Cohen, Leonard J. Schulman, Bernhard Haeupler

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

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) 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)

Related Items (3)

On matrices potentially useful for tree codes ⋮ Palette-alternating tree codes ⋮ Monotone circuit lower bounds from robust sunflowers

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