A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet
Computational Complexity
2020-02-20 v1
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.
Cite
@article{arxiv.2002.08231,
title = {A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet},
author = {Siddharth Bhandari and Prahladh Harsha},
journal= {arXiv preprint arXiv:2002.08231},
year = {2020}
}