Two families of linear codes containing non-GRS MDS codes
Designs, Codes and Cryptography · 2026-07 · 94 (7)
DOI: 10.1007/s10623-026-01890-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Designs, Codes and Cryptography, online erschienen am 18.06.2026. Verfasst von Kanat Abdukhalikov und 1 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben. Gefördert von: United Arab Emirates University.
Abstract (Originalsprache)
We construct two new families of linear codes by modifying the generator matrices of generalized Reed–Solomon (GRS) codes. For these codes, we explicitly derive parity-check matrices and establish necessary and sufficient conditions ensuring the MDS property. Additionally, we explore subfamilies within these constructions that are non-GRS MDS codes. We also characterize their self-orthogonal and self-dual properties and present some explicit constructions and examples.
Förderung
- United Arab Emirates University
Zitieren
APA
Abdukhalikov, K., & Verma, G. K. (2026). Two families of linear codes containing non-GRS MDS codes. Designs, Codes and Cryptography, 94(7). https://doi.org/10.1007/s10623-026-01890-2
Vancouver
Abdukhalikov K, Verma GK. Two families of linear codes containing non-GRS MDS codes. Designs, Codes and Cryptography. 2026;94(7). doi:10.1007/s10623-026-01890-2
BibTeX
@article{Abdukhalikov2026,
author = {Abdukhalikov, Kanat and Verma, Gyanendra K.},
title = {Two families of linear codes containing non-GRS MDS codes},
journal = {Designs, Codes and Cryptography},
year = {2026},
volume = {94},
number = {7},
doi = {10.1007/s10623-026-01890-2}
}
EUVIMED