@InProceedings{benyaacov_et_al:LIPIcs.APPROX/RANDOM.2021.54,
author = {Ben Yaacov, Inbar and Cohen, Gil and Narayanan, Anand Kumar},
title = {{Candidate Tree Codes via Pascal Determinant Cubes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
pages = {54:1--54:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-207-5},
ISSN = {1868-8969},
year = {2021},
volume = {207},
editor = {Wootters, Mary and Sanit\`{a}, Laura},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.54},
URN = {urn:nbn:de:0030-drops-147474},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.54},
annote = {Keywords: Tree codes, Sparse polynomials, Explicit constructions}
}