Sum-rank product codes and bounds on the minimum distance

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Ordinary and skew polynomial rings and semigroup rings (16S36) Cyclic codes (94B15) Bounds on codes (94B65)

Abstract: The tensor product of one code endowed with the Hamming metric and one endowed with the rank metric is analyzed. This gives a code which naturally inherits the sum-rank metric. Specializing to the product of a cyclic code and a skew-cyclic code, the resulting code turns out to belong to the recently introduced family of cyclic-skew-cyclic. A group theoretical description of these codes is given, after investigating the semilinear isometries in the sum-rank metric. Finally, a generalization of the Roos and the Hartmann-Tzeng bounds for the sum rank-metric is established, as well as a new lower bound on the minimum distance of one of the two codes constituting the product code.

Review text

\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.

Recommendations

Cites work

Cited in

(14)

This page was built for publication: Sum-rank product codes and bounds on the minimum distance

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