vix.ing · top · new · best · stats · spec

Twisted Linearized Reed-Solomon Codes: A Skew Polynomial Framework

2021/05/21 by Alessandro Neri, Neri, Alessandro · 6 citations
Computer Science · Engineering · #11T71 #16S36 #94B05 #Advanced Wireless Communication Techniques #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Rings and Algebras (math.RA) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2105.10451

openalex publication_date 2021/05/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time the skew group algebra setting for rank-metric codes and the polynomial setting for codes in the Hamming metric. This allows to construct twisted linearized Reed-Solomon codes, a new family of maximum sum-rank distance codes extending at the same time Sheekey's twisted Gabidulin codes in the rank metric and twisted Reed-Solomon codes in the Hamming metric. Furthermore, we provide an analogue in the sum-rank metric of Trombetti-Zhou construction, which also provides a family of maximum sum-rank distance codes. As a byproduct, in the extremal case of the Hamming metric, we obtain a new family of additive MDS codes over quadratic fields.

Cited by

Related