Tensor representation of rank-metric codes

DOI10.1137/19M1253964MaRDI QIDQ5208886zbMATH OpenWikidataFDO

Authors Eimear Byrne, Alessandro Neri, Alberto Ravagnani, John Sheekey

Publication date 22 January 2020

Published in SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

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

zbMATH Keywords

Delsarte-Gabidulin codegenerator tensorminimal tensor rankMRD codeMTR coderank metrictensortensor extremal codetensor rank

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Abstract: We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We define the generator tensor and the parity check tensor of a matrix code, and describe the properties of a code through these objects. We define the tensor rank of a code to be the tensor rank of its generating tensors, and propose that this quantity is a significant coding theoretic parameter. By a result on the tensor rank of Kruskal from the 1970s, the tensor rank of a rank-metric code of dimension $k$ and minimum rank distance $d$ is at least $k+d-1$. We call codes that meet this bound minimal tensor rank (MTR) codes. It is known from results in algebraic complexity theory that an MTR code implies the existence of an MDS code. In this paper, we also address the converse problem, that of the existence of an MTR code, given an MDS code. We identify several parameters for which the converse holds and give explicit constructions of MTR codes using MDS codes. We furthermore define generalized tensor ranks, which give a refinement of the tensor rank as a code invariant. Moreover, we use these to distinguish inequivalent rank-metric codes.

Recommendations

• Non-minimum tensor rank Gabidulin codes
• scientific article; zbMATH DE number 2154122
• Tensor codes for the rank metric
• Theory of codes with maximum rank distance
• MRD codes: constructions and connections

Cites work

• Advanced linear algebra
• Bilinear forms over a finite field, with applications to coding theory
• Canonical forms of \(2 \times 3 \times 3\) tensors over the real field, algebraically closed fields, and finite fields
• Covering radius of matrix codes endowed with the rank metric
• Finite semifields and nonsingular tensors
• Finite semifields and projective planes
• Generalized weights: an anticode approach
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 905159 (Why is no real title available?)
• Maximum-rank array codes and their application to crisscross error correction
• On MDS extensions of generalized Reed- Solomon codes
• On nonsingular tensors and related projective planes
• On the optimal evaluation of a set of bilinear forms
• On the rank of 3 3 3-tensors
• On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
• Rank-metric codes
• Subspace codes from Ferrers diagrams
• Tensor rank is NP-complete
• The automorphism groups of Reed-Solomon codes
• 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

(11)

• Rank-metric lattices
• The tensor rank of semifields of order 16 and 81
• Extending two families of maximum rank distance codes
• Non-minimum tensor rank Gabidulin codes
• Tensor codes for the rank metric
• Tensor Codes and Their Invariants
• Constructions of perfect bases for classes of 3-tensors
• Monomial isomorphism for tensors and applications to code equivalence problems
• Strassen's rank additivity for small tensors, including tensors of rank less or equal 7
• Zeta functions for tensor codes
• Valued rank-metric codes

This page was built for publication: Tensor representation of rank-metric codes

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