Name
Title | ||
|---|---|---|
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet |
Abstract | ||
|---|---|---|
Recently, Cohen, Haeupler and Schulman gave an explicit construction of binary tree codes over polylogarithmic-sized output alphabet based on Pudl\'{a}k's construction of maximum-distance-separable (MDS) tree codes using totally-non-singular triangular matrices. In this short note, we give a unified and simpler presentation of Pudl\'{a}k and Cohen-Haeupler-Schulman's constructions. |
Year | Venue | DocType |
|---|---|---|
2020 | Electronic Colloquium on Computational Complexity (ECCC) | Journal |
Volume | Citations | PageRank |
27 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siddharth Bhandari | 1 | 0 | 3.04 |
| Prahladh Harsha | 2 | 371 | 32.06 |