2000 character limit reached
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet (2002.08231v1)
Published 19 Feb 2020 in cs.CC
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.