与编码理论相关的3-张量的双线性复杂度
Bilinear Complexity of 3-Tensors Linked to Coding Theory
摘要:
在代数复杂性理论中,一个研究得很好的问题是依赖于双线性映射的评估来确定问题的复杂性。双线性映射(或3-张量)的复杂性的一个度量是计算它所需的非标量乘法的最佳数量。这个数量也被描述为它的张量秩,这是秩1矩阵的最小数量,其跨度包含它的第一个切片空间。本文给出了某些类$3$ -张量的张量秩的上界,并给出了包含第一片空间的秩为1的矩阵集合的显式构造。我们还展示了如何将这些结果可以应用在编码理论中,推导出一些秩度量码的张量秩的上界。特别是,我们计算的张量秩的一些家庭的$\mathbb{F}_{q^m}$ -线性码,我们表明,他们是极值Kruskal的张量秩界。
英文摘要:
A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of non-scalar multiplications required to evaluate it. This quantity is also described as its tensor rank, which is the smallest number of rank one matrices whose span contains its first slice space. In this paper we derive upper bounds on the tensor ranks of certain classes of $3$-tensors and give explicit constructions of sets of rank one matrices containing their first slice spaces. We also show how these results can be applied in coding theory to derive upper bounds on the tensor rank of some rank-metric codes. In particular, we compute the tensor rank of some families of $\mathbb{F}_{q^m}$-linear codes and we show that they are extremal with respect to Kruskal's tensor rank bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。