关于树码的矩阵
On matrices potentially useful for tree codes
摘要:
受[1]中研究的概念的启发,我们考虑有限域上矩阵的一个性质,它将三角完全非奇异矩阵推广到分块矩阵。我们证明了:(1)具有此性质的矩阵足以构造好的树码;(2)二次域上的随机块三角矩阵满足此性质。我们还将表明,这种随机化的建设产生的代码在二次大小的字段的速率和最小相对距离的总和得到任意接近1。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。