Non-minimum tensor rank Gabidulin codes

DOI10.1016/J.LAA.2022.06.012MaRDI QIDQ2154304zbMATHOpenAlexWikidataFDO

Authors Daniele Bartoli, Giovanni Zini, Ferdinando Zullo

Publication date 19 July 2022

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

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

zbMATH Keywords

tensor rankrank metric codes

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Abstract: The tensor rank of some Gabidulin codes of small dimension is investigated. In particular, we determine the tensor rank of any rank metric code equivalent to an $8$-dimensional $mathbb{F}_q$-linear generalized Gabidulin code in $mathbb{F}_q^{4imes4}$. This shows that such a code is never minimum tensor rank. In this way, we detect the first infinite family of Gabidulin codes which are not minimum tensor rank.

Recommendations

• Tensor representation of rank-metric codes
• On the number of inequivalent Gabidulin codes
• Explicit constructions of some non-Gabidulin linear maximum rank distance codes
• On the genericity of maximum rank distance and Gabidulin codes
• Tensor codes for the rank metric

Cites work

• scientific article; zbMATH DE number 177612 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• A Rank-Metric Approach to Error Control in Random Network Coding
• Algebraic complexities and algebraic curves over finite fields
• Algebraic structures of MRD codes
• Bilinear forms over a finite field, with applications to coding theory
• Connections between scattered linear sets and MRD-codes
• Finite semifields and nonsingular tensors
• Finite semifields and projective planes
• Identifiability of parameters in latent structure models with many observed variables
• Linearized polynomials over finite fields revisited
• MRD codes: constructions and connections
• Maximum-rank array codes and their application to crisscross error correction
• On Generic Identifiability of 3-Tensors of Small Rank
• On nonsingular tensors and related projective planes
• On the rank of \(3\times 3\times 3\)-tensors
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• Tensor Codes and Their Invariants
• Tensor rank is NP-complete
• Tensor representation of rank-metric codes
• The tensor rank of semifields of order 16 and 81
• Theory of codes with maximum rank distance
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics

Cited in

(4)

• Tensor Codes and Their Invariants
• Constructions of perfect bases for classes of 3-tensors
• Tensor representation of rank-metric codes
• Zeta functions for tensor codes

This page was built for publication: Non-minimum tensor rank Gabidulin codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154304)