Some constructions of non-generalized Reed-Solomon MDS codes

Discrete Mathematics 2026 Open access

Read full text
Authors: Kanat Serikovich Abdukhalikov, Cunsheng Ding, Gyanendra K. Verma
DOI: 10.1016/j.disc.2026.115202
Cited by: 0

Abstract

We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs in finite projective spaces, we give a new characterization of o-monomials.

Fields of Study & Subjects

Coding theory and cryptography Quantum Computing Algorithms and Architecture graph theory and CDMA systems

Publication details

Journal / source
Discrete Mathematics
Volume
349
Issue
10
Pages
115202–115202
Publication date
7 May 2026
Language
EN