Linear tree codes and the problem of explicit constructions

27 Aug 2015 · Pudlák Pavel ·

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.