  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.
