REVIEW 2 cited by
A family of linear codes that are either non-GRS MDS codes or NMDS 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
read the original abstract
Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we introduce and study a new family of linear codes involving their parameters, weight distributions, and self-orthogonal properties. We prove that such codes are either non-GRS MDS codes or NMDS codes, and hence, they can produce as many of the desired codes as possible. We also completely determine their weight distributions with the help of the solutions to some subset sum problems. A sufficient and necessary condition for such codes to be self-orthogonal is characterized. Based on this condition, we further deduce that there are no self-dual codes in this class of linear codes and explicitly construct two new classes of almost self-dual codes.
Forward citations
Cited by 2 Pith papers
-
On subcodes of the generalized Reed-Solomon codes
It characterizes self-duality and near-MDS status for one-codimensional subcodes of generalized Reed-Solomon codes for all r, and determines the dual codes for r=1,2,k-1.
-
Some constructions of non-generalized Reed-Solomon MDS Codes
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.
Discussion (0). Continue with ORCID to comment.