Linear tree codes and the problem of explicit constructions
classification
💻 cs.IT
math.IT
keywords
problemcodesfieldstreeasymptoticallybirkhoffconnectionconstructing
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.