Sum-rank product codes and bounds on the minimum distance (Q2123308)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7505588
Language Label Description Also known as
default for all languages
No label defined
    English
    Sum-rank product codes and bounds on the minimum distance
    scientific article; zbMATH DE number 7505588

      Statements

      Sum-rank product codes and bounds on the minimum distance (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      8 April 2022
      0 references
      \textit{U. Martínez-Peñas} introduced the family of cyclic-skew-cyclic codes endowed with the sum-rank metric [IEEE Trans. Inf. Theory 67, No. 8, 5149--5167 (2021; Zbl 1486.94178)]. Inspired by this work, the authors of the paper under review consider the tensor product of a cyclic code endowed with the Hamming metric with a skew-cyclic code endowed with the rank-metric, both defined over the same field \(\mathbb{F}\). Such a product code turns out to be a cyclic-skew-cyclic code which naturally inherits the sum-rank metric. A group theoretical description of these codes is given, after investigating the semilinear isometries in the sum-rank metric. As a nice application, the authors provide a generalization of the Roos and the Hartmann-Tzeng bounds for cyclic-skew-cyclic codes endowed with the sum-rank metric.
      0 references
      0 references
      cyclic codes
      0 references
      skew-cyclic codes
      0 references
      Roos bound
      0 references
      sum-rank metric
      0 references
      tensor product codes
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references