Pith. sign in

REVIEW 1 cited by

Constructions of non-Generalized Reed-Solomon MDS codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.08391 v1 pith:T72IRLWB submitted 2024-12-11 cs.IT math.IT

classification cs.ITmath.IT
keywords codesreed-solomonnon-generalizedgeneralizeddistanceexamplesfamiliesthen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Generalized Reed-Solomon codes form the most prominent class of maximum distance separable (MDS) codes, codes that are optimal in the sense that their minimum distance cannot be improved for a given length and code size. The study of codes that are MDS yet not generalized Reed-Solomon codes, called non-generalized Reed-Solomon MDS codes, started with the work by Roth and Lemple (1989), where the first examples where exhibited. It then gained traction thanks to the work by Beelen (2017), who introduced twisted Reed-Solomon codes, and showed that families of such codes are non-generalized Reed-Solomon MDS codes. Finding non-generalized Reed-Solomon MDS codes is naturally motivated by the classification of MDS codes. In this paper, we provide a generic construction of MDS codes, yielding infinitely many examples. We then explicit families of non-generalized Reed-Solomon MDS codes. Finally we position some of the proposed codes with respect to generalized twisted Reed-Solomon codes, and provide new view points on this family of codes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Some constructions of non-generalized Reed-Solomon MDS Codes

    cs.IT 2025-06 conditional novelty 5.0 of 10

    Necessary and sufficient conditions are given for two extended evaluation-code families to be non-GRS MDS codes, and o-monomials are characterized by nonvanishing complete symmetric functions.

Pith tools