Name
Abstract | ||
|---|---|---|
This paper makes progress on the problem of explicitly constructing a binary tree code with constant distance and constant alphabet size.
We give an explicit binary tree code with constant distance and alphabet size poly(logn), where n is the depth of the tree. This is the first improvement over a two-decade-old construction that has an exponentially larger alphabet of size poly(n).
At the core of our construction is the first explicit tree code with constant rate and constant distance, though with non-constant arity - a result of independent interest. This construction adapts the polynomial interpolation framework to the online setting.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3188745.3188928 | STOC '18: Symposium on Theory of Computing
Los Angeles
CA
USA
June, 2018 |
Keywords | DocType | Volume |
tree codes,sparse polynomials,explicit constructions | Conference | 25 |
ISSN | ISBN | Citations |
0737-8017 | 978-1-4503-5559-9 | 0 |
PageRank | References | Authors |
0.34 | 34 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gil Cohen | 1 | 119 | 16.43 |
| Bernhard Haeupler | 2 | 628 | 54.00 |
| Leonard J. Schulman | 3 | 1328 | 136.88 |