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

02/19/2020

∙

by   Siddharth Bhandari, et al.

∙

0

∙

share

Recently, Cohen, Haeupler and Schulman gave an explicit construction of binary tree codes over polylogarithmic-sized output alphabet based on Pudlá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ák and Cohen-Haeupler-Schulman's constructions.