On matrices potentially useful for tree codes
From MaRDI portal
Publication:6355369
DOI10.1016/J.IPL.2021.106180arXiv2012.03013MaRDI QIDQ6355369
Publication date: 5 December 2020
Abstract: Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good tree codes and (2) a random block-triangular matrix over a field of quadratic size satisfies this property. We will also show that a generalization of this randomized construction yields codes over quadratic size fields for which the sum of the rate and minimum relative distance gets arbitrarily close to 1.
This page was built for publication: On matrices potentially useful for tree codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355369)
