2000 character limit reached
Linear tree codes and the problem of explicit constructions
Published 21 Oct 2013 in cs.IT and math.IT | (1310.5684v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
