Hermitian Self-dual Twisted Generalized Reed-Solomon Codes

Self-dual maximum distance separable (MDS) codes over finite fields are linear codes with significant combinatorial and cryptographic applications. Twisted generalized Reed-Solomon (TGRS) codes can be both MDS and self-dual. In this paper, we study a general class of TGRS codes (A-TGRS), which encompasses all previously known special cases. First, we establish a sufficient and necessary condition for an A-TGRS code to be Hermitian self-dual. Furthermore, we present four constructions of self-dual TGRS codes, which, to the best of our knowledge, nearly cover all the related results previously reported in the literature. More importantly, we also obtain several new classes of Hermitian self-dual TGRS codes with flexible parameters. Based on this framework, we derive a sufficient and necessary condition for an A-TGRS code to be Hermitian self-dual and MDS. In addition, we construct a class of MDS Hermitian self-dual TGRS code by appropriately selecting the evaluation points. This work investigates the Hermitian self-duality of TGRS codes from the perspective of matrix representation, leading to more concise and transparent analysis. More generally, the Euclidean self-dual TGRS codes and the Hermitian self-dual GRS codes can also be understood easily from this point.

Publication Details

Journal
ArXiv.org
Published
2025-08-13
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hermitian Self-dual Twisted Generalized Reed-Solomon Codes

ArXiv.org
Coding theory and cryptography
article

Hermitian Self-dual Twisted Generalized Reed-Solomon Codes

article en

Abstract

Self-dual maximum distance separable (MDS) codes over finite fields are linear codes with significant combinatorial and cryptographic applications. Twisted generalized Reed-Solomon (TGRS) codes can be both MDS and self-dual. In this paper, we study a general class of TGRS codes (A-TGRS), which encompasses all previously known special cases. First, we establish a sufficient and necessary condition for an A-TGRS code to be Hermitian self-dual. Furthermore, we present four constructions of self-dual TGRS codes, which, to the best of our knowledge, nearly cover all the related results previously reported in the literature. More importantly, we also obtain several new classes of Hermitian self-dual TGRS codes with flexible parameters. Based on this framework, we derive a sufficient and necessary condition for an A-TGRS code to be Hermitian self-dual and MDS. In addition, we construct a class of MDS Hermitian self-dual TGRS code by appropriately selecting the evaluation points. This work investigates the Hermitian self-duality of TGRS codes from the perspective of matrix representation, leading to more concise and transparent analysis. More generally, the Euclidean self-dual TGRS codes and the Hermitian self-dual GRS codes can also be understood easily from this point.

ArXiv.org
Openalex Percentile: Top 73%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.