Non-minimum tensor rank Gabidulin codes

DOI10.1016/J.LAA.2022.06.012zbMATH Open1498.14070arXiv2201.08242OpenAlexW4282918655WikidataQ114151394 ScholiaQ114151394MaRDI QIDQ2154304FDOQ2154304

Authors: Daniele Bartoli, Giovanni Zini, Ferdinando Zullo 

Publication date: 19 July 2022

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

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.

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

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

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)

Cites Work

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

Cited In (3)

• Tensor representation of rank-metric codes
• Constructions of perfect bases for classes of 3-tensors
• 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)