Hermitian Self-dual Generalized Reed-Solomon Codes

Hermitian Self-dual Generalized Reed-Solomon Codes
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.

Maximum Distance Separable (MDS) self-dual codes are of significant theoretical and practical importance. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Correspondingly there have been many research on constructions of Euclidean self-dual MDS codes by using GRS codes. However, the study on Hermitian self-dual GRS codes is relatively limited. Since Hermitian self-dual GRS codes do not exist for $n>q+1$, this paper is devoted to an investigation of GRS codes in the case where $n\le q+1$. First, we prove that when $n\leq q+1$, there are only two classes of Hermitian self-dual GRS codes, confirming the conjecture in [13] and providing its proof simultaneously. Second, we present two explicit construction methods. Thus, the existence and construction of Hermitian self-dual GRS codes are fully solved.


💡 Research Summary

The paper addresses the long‑standing problem of characterizing Hermitian self‑dual generalized Reed‑Solomon (GRS) codes over the field 𝔽_{q²}. While Euclidean self‑dual GRS codes have been extensively studied, the Hermitian case has remained largely unexplored, especially concerning the existence and explicit construction of such codes when the length n exceeds q + 1. Building on earlier conjectures (notably the one in


Comments & Academic Discussion

Loading comments...

Leave a Comment