Linear tree codes and the problem of explicit constructions
Information Theory
2015-08-28 v4 math.IT
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.
Cite
@article{arxiv.1310.5684,
title = {Linear tree codes and the problem of explicit constructions},
author = {Pavel Pudlák},
journal= {arXiv preprint arXiv:1310.5684},
year = {2015}
}