Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR20-019 | 19th February 2020 17:01

A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet

RSS-Feed




TR20-019
Authors: Siddharth Bhandari, Prahladh Harsha
Publication: 19th February 2020 17:04
Downloads: 152
Keywords: 


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.



ISSN 1433-8092 | Imprint