Sum-rank product codes and bounds on the minimum distance

DOI10.1016/J.FFA.2022.102013MaRDI QIDQ2123308zbMATH OpenOpenAlexWikidataFDO

Authors Gianira N. Alfarano, F. J. Lobillo, Alessandro Neri, Antonia Wachter-Zeh

Publication date 8 April 2022

Published in Finite Fields and their Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

cyclic codesRoos boundskew-cyclic codessum-rank metrictensor product codes

Mathematics Subject Classification ID

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.

Recommendations

• Roos bound for skew cyclic codes in Hamming and rank metric
• On the roots and minimum rank distance of skew cyclic codes
• Theory of supports for linear codes endowed with the sum-rank metric
• Twisted linearized Reed-Solomon codes: a skew polynomial framework
• Hamming and simplex codes for the sum-rank metric

Cites work

• A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
• A new lower bound for the minimum distance of a cyclic code
• A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
• Codes as modules over skew polynomial rings
• Coding with skew polynomial rings
• Concatenation of convolutional codes and rank metric codes for multi-shot network coding
• Convolutional Codes With Maximum Column Sum Rank for Network Streaming
• Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
• Further results on error correcting binary group codes
• Generalizations of the BCH bound
• Hamming and simplex codes for the sum-rank metric
• Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
• scientific article; zbMATH DE number 3147923 (Why is no real title available?)
• Isometries for rank distance and permutation group of gabidulin codes
• MacWilliams extension theorems and the local-global property for codes over Frobenius rings
• NONCOMMUTATIVE SYMMETRIC FUNCTIONS AND W-POLYNOMIALS
• On a class of error correcting binary group codes
• Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
• Roos bound for skew cyclic codes in Hamming and rank metric
• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
• Skew codes of prescribed distance or rank
• Skew-cyclic codes
• Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes
• Theory of non-commutative polynomials
• Theory of supports for linear codes endowed with the sum-rank metric
• Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
• Vandermonde and Wronskian matrices over division rings
• Wedderburn polynomials over division rings, II
• Wedderburn polynomials over division rings. I.

Cited in

(13)

• Roos bound for skew cyclic codes in Hamming and rank metric
• The geometry of one-weight codes in the sum-rank metric
• Twisted linearized Reed-Solomon codes: a skew polynomial framework
• Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
• The minimum distance of codes in an array coming from telescopic semigroups
• On the roots and minimum rank distance of skew cyclic codes
• Codes in the sum-rank metric: fundamentals and applications
• Hardness estimates of the code equivalence problem in the rank metric
• Distinguishing and recovering generalized linearized Reed-Solomon codes
• Doubly and triply extended MSRD codes
• One-weight codes in the sum-rank metric
• Decoding up to Hartmann-Tzeng and Roos bounds for rank codes
• On MSRD codes, h-designs and disjoint maximum scattered linear sets

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)