An algebraic-coding equivalence to the maximum distance separable conjecture

DOI10.2140/INVOLVE.2024.17.363MaRDI QIDQ6596262zbMATH OpenFDO

Authors S. B. Damelin, Daniel Kaiser, Jeffrey Sun, Safal Bora

Publication date 2 September 2024

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/INVOLVE.2024.17.363

zbMATH Keywords

algebraic geometryarcscoding theorylinear independencemaximum distance separable conjectureprojective spaces

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Linear codes (general theory) (94B05)

Recommendations

• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
• Inclusion matrices and the MDS conjecture
• scientific article; zbMATH DE number 703977
• A new approach to the main conjecture on algebraic-geometric MDS codes

Cites work

• Arcs in finite projective spaces
• Grassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes
• Maximum distance<tex>q</tex>-nary codes
• On additive MDS codes over small fields
• On MDS extensions of generalized Reed- Solomon codes
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• On Subsets of the Normal Rational Curve

This page was built for publication: An algebraic-coding equivalence to the maximum distance separable conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596262)