2000 character limit reached
Some constructions of non-generalized Reed-Solomon MDS Codes (2506.04080v2)
Published 4 Jun 2025 in cs.IT and math.IT
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.