论文标题
关于树代码的显式结构的注释，
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet
论文作者
论文摘要
最近，Cohen，Haeupler和Schulman基于Pudlák使用完全不合格的三角形三角形矩阵的最大距离分离（MDS）树代码构建了基于Pologarithmits尺寸输出字母的二元树代码明确结构。在此简短的说法中，我们给出了Pudlák和Cohen-Haeupler-Schulman的构造的统一和简单的介绍。
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.
