Linear tree codes and the problem of explicit constructions

DOI10.1016/j.laa.2015.10.030zbMath1366.94749arXiv1310.5684OpenAlexW2964232484MaRDI QIDQ898793

Pavel Pudlák

Publication date: 18 December 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5684

zbMATH Keywords

tree codeerror correcting codetriangular totally nonsingular matrix

Mathematics Subject Classification ID

Other types of codes (94B60) Special matrices (15B99)

Related Items

On matrices potentially useful for tree codes ⋮ Palette-alternating tree codes ⋮ Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement of the tree code construction
• The LU-factorization of totally positive matrices
• Tree codes and a conjecture on exponential sums
• Coding for interactive communication
• On generator matrices of MDS codes (Corresp.)
• Deterministic coding for interactive communication
• Maximum distance<tex>q</tex>-nary codes