2013/10/21 by Pavel Pudlák, Pudlák, Pavel
Computer Science · Mathematics · #94B60 #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT #msc:94B60
paper · pdf · doi:10.48550/arxiv.1310.5684
arxiv created 2015/08/27 · arxiv updated 2015/08/28
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.