A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet
暂无分享,去创建一个
[1] Audra E. Kosh,et al. Linear Algebra and its Applications , 1992 .
[2] Leonard J. Schulman,et al. Explicit binary tree codes with polylogarithmic size alphabet , 2018, Electron. Colloquium Comput. Complex..
[3] I. Mazin,et al. Theory , 1934 .
[4] Leonard J. Schulman. Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.
[5] B. M. Fulk. MATH , 1992 .
[6] Anand Kumar Narayanan,et al. On Decoding Cohen-Haeupler-Schulman Tree Codes , 2019, SODA.
[7] I. Gessel,et al. Binomial Determinants, Paths, and Hook Length Formulae , 1985 .
[8] B. Lindström. On the Vector Representations of Induced Matroids , 1973 .
[9] Pavel Pudlák,et al. Linear tree codes and the problem of explicit constructions , 2013, ArXiv.
[10] Ran Gelles,et al. Coding for Interactive Communication: A Survey , 2017, Found. Trends Theor. Comput. Sci..