论文信息 - Linear tree codes and the problem of explicit constructions

Linear tree codes and the problem of explicit constructions

We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation in finite fields.

Pavel Pudlák | P. Pudlák

[1] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[2] Yuan Zhou. Introduction to Coding Theory , 2010 .

[3] Richard C. Singleton,et al. Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[4] Ron M. Roth,et al. On generator matrices of MDS codes , 1985, IEEE Trans. Inf. Theory.

[5] Shaun M. Fallat,et al. Totally Nonnegative Matrices , 2011 .

[6] G. Pólya,et al. Bemerkung zur Interpolation und zur Näherungstheorie der Balkenbiegung , 1931 .

[7] Colin W. Cryer,et al. The LU-factorization of totally positive matrices , 1973 .

[8] Leonard J. Schulman,et al. Deterministic coding for interactive communication , 1993, STOC.

[9] M. Fiedler. Special matrices and their applications in numerical mathematics , 1986 .

[10] Jacobus H. van Lint,et al. Introduction to Coding Theory , 1982 .

[11] Leonard J. Schulman. Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.

[12] Marcin Peczarski. An improvement of the tree code construction , 2006, Inf. Process. Lett..

[13] Cristopher Moore,et al. Tree codes and a conjecture on exponential sums , 2013, ITCS.