Additive codes attain the Griesmer bound with equality for sufficiently large minimum distance, giving infinite series of optimal codes superior to linear codes.
New families of non-Reed-Solomon MDS codes
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 3roles
background 1polarities
background 1representative citing papers
Two new families of linear codes are built from modified GRS generator matrices, producing non-GRS MDS codes with derived parity-check matrices and self-duality conditions.
A new twisted version of elliptic curve codes is defined, with explicit dual parity-check matrices, self-duality criteria, minimum-distance classification, and Schur-square-based non-equivalence to Reed-Solomon and elliptic codes.
citing papers explorer
-
Additive codes attaining the Griesmer bound
Additive codes attain the Griesmer bound with equality for sufficiently large minimum distance, giving infinite series of optimal codes superior to linear codes.
-
Two Families of Linear Codes Containing Non-GRS MDS Codes
Two new families of linear codes are built from modified GRS generator matrices, producing non-GRS MDS codes with derived parity-check matrices and self-duality conditions.
-
On a class of twisted elliptic curve codes
A new twisted version of elliptic curve codes is defined, with explicit dual parity-check matrices, self-duality criteria, minimum-distance classification, and Schur-square-based non-equivalence to Reed-Solomon and elliptic codes.