Roth–Lempel NMDS Codes of Non-Elliptic-Curve Type
IEEE Transactions on Information Theory · 2023-09 · 69 (9) · 5670-5675
DOI: 10.1109/tit.2023.3272384 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2023-09. Verfasst von Dongchun Han und 1 weiteren Autor:innen. Die Arbeit wurde bisher 21-mal zitiert (Crossref) und nennt 32 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Sichuan Province, Fundamental Research Funds for the Central Universities.
Abstract (Originalsprache)
The defect of an $[n,k,d]$ linear code is defined as $s({\mathcal{ C}})=n-k+1-d$ . Codes with $s({\mathcal{ C}})=0$ are called maximum distance separable (MDS), while codes with $s({\mathcal{ C}})=s({\mathcal{ C}}^{\perp})=1$ are called near maximum distance separable (NMDS). NMDS codes correspond to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. There have been many constructions of NMDS codes, but most of them are focus on fixed $q$ or $k$ , except for constructions from elliptic curves. Roth and Lempel (IEEE Trans. Inf. Theory 1989) constructed a type of linear codes (referred as Roth-Lempel codes), and presented the necessary and sufficient conditions of Roth-Lempel code to be MDS. Especially, they pointed out that the resultant MDS codes is not linearly equivalent to Reed-Solomn codes. In this paper, the NMDS properties of Roth-Lempel codes will be analyzed. We also obtain the necessary and sufficient condition of Roth-Lempel codes to be NMDS, and further completely determine the weight distributions of Roth-Lempel codes with length $q+2$ and dimension $3\leq k\leq q$ . Besides, by analyzing the upper bound for the code lengths of elliptic curve MDS codes, we illustrate the linearly inequivalence of Roth-Lempel NMDS codes and elliptic curve NMDS codes when their corresponding code lengths exceed $4(q+2\sqrt {q}+1)/5+1$ .
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Sichuan Province
- Fundamental Research Funds for the Central Universities
Zitieren
APA
Han, D., & Fan, C. (2023). Roth–Lempel NMDS Codes of Non-Elliptic-Curve Type. IEEE Transactions on Information Theory, 69(9), 5670-5675. https://doi.org/10.1109/tit.2023.3272384
Vancouver
Han D, Fan C. Roth–Lempel NMDS Codes of Non-Elliptic-Curve Type. IEEE Transactions on Information Theory. 2023;69(9):5670-5675. doi:10.1109/tit.2023.3272384
BibTeX
@article{Han2023,
author = {Han, Dongchun and Fan, Cuiling},
title = {Roth–Lempel NMDS Codes of Non-Elliptic-Curve Type},
journal = {IEEE Transactions on Information Theory},
year = {2023},
volume = {69},
number = {9},
pages = {5670--5675},
doi = {10.1109/tit.2023.3272384}
}
EUVIMED