English

Hermitian Self-dual Generalized Reed-Solomon Codes

Information Theory 2026-02-09 v1 math.IT

Abstract

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+1n>q+1, this paper is devoted to an investigation of GRS codes in the case where nq+1n\le q+1. First, we prove that when nq+1n\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.

Keywords

Cite

@article{arxiv.2602.06377,
  title  = {Hermitian Self-dual Generalized Reed-Solomon Codes},
  author = {Chun'e Zhao and Wenping Ma},
  journal= {arXiv preprint arXiv:2602.06377},
  year   = {2026}
}
R2 v1 2026-07-01T10:23:42.457Z