Abstract: In 1991, Roth introduced a natural generalization of rank metric codes, namely tensor codes. The latter are defined to be subspaces of -tensors where the ambient space is endowed with the tensor rank as a distance function. In this work, we describe the general class of tensor codes and we study their invariants that correspond to different families of anticodes. In our context, an anticode is a perfect space that has some additional properties. A perfect space is one that is spanned by tensors of rank 1. Our use of the anticode concept is motivated by an interest in capturing structural properties of tensor codes. In particular, we indentify four different classes of tensor anticodes and show how these gives different information on the codes they describe. We also define the generalized tensor binomial moments and the generalized tensor weight distribution of a code and establish a bijection between these invariants. We use the generalized tensor binomial moments to define the concept of an -tensor BMD code, which is an extremal code in relation to an inequality arising from them. Finally, we give MacWilliams identities for generalized tensor binomial moments.
Recommendations
Cites work
- Bilinear forms over a finite field, with applications to coding theory
- Generalized weights: an anticode approach
- scientific article; zbMATH DE number 3886512 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- Is code equivalence easy to decide?
- Maximum-rank array codes and their application to crisscross error correction
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- Parameters of Codes for the Binary Asymmetric Channel
- Rank metric codes and zeta functions
- Rank-metric codes and their duality theory
- Rank-metric codes, generalized binomial moments and their zeta functions
- Tensor codes for the rank metric
- Tensor representation of rank-metric codes
- The hardness of code equivalence over F_q and its application to code-based cryptography
- The Magma algebra system. I: The user language
- The Ranks of m \times n \times (mn - 2) Tensors
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Weight distribution of rank-metric codes
Cited in
(3)
This page was built for publication: Tensor Codes and Their Invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077976)
