Constructions of perfect bases for classes of 3-tensors

DOI10.1016/j.laa.2023.11.019OpenAlexW4388923824MaRDI QIDQ6187351

Giuseppe Cotardo, Eimear Byrne

Publication date: 15 January 2024

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

Full work available at URL: https://doi.org/10.1016/j.laa.2023.11.019

zbMATH Keywords

perfect spacetensor rankrank-metric codebilinear complexityperfect base3-tensorminimal tensor rankMTR

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Complexity of computation (including implicit computational complexity) (03D15) Basic linear algebra (15A99)

Cites Work

• On the maximal multiplicative complexity of a family of bilinear forms
• On the algorithmic complexity of associative algebras
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• On the optimal evaluation of a set of bilinear forms
• Bilinear forms over a finite field, with applications to coding theory
• On the number of inequivalent Gabidulin codes
• The tensor rank of semifields of order 16 and 81
• Non-minimum tensor rank Gabidulin codes
• The Ranks of $m \times n \times (mn - 2)$ Tensors
• Optimal Evaluation of Pairs of Bilinear Forms
• Tensor Representation of Rank-Metric Codes
• Maximum-rank array codes and their application to crisscross error correction

This page was built for publication: Constructions of perfect bases for classes of 3-tensors