Linear tree codes and the problem of explicit constructions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F16%3A00450633" target="_blank" >RIV/67985840:_____/16:00450633 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.laa.2015.10.030" target="_blank" >http://dx.doi.org/10.1016/j.laa.2015.10.030</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.laa.2015.10.030" target="_blank" >10.1016/j.laa.2015.10.030</a>
Alternative languages
Result language
angličtina
Original language name
Linear tree codes and the problem of explicit constructions
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Linear Algebra and Its Applications
ISSN
0024-3795
e-ISSN
—
Volume of the periodical
490
Issue of the periodical within the volume
February 1
Country of publishing house
US - UNITED STATES
Number of pages
21
Pages from-to
124-144
UT code for WoS article
000370461400008
EID of the result in the Scopus database
2-s2.0-84946926159