An Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture

arXiv1705.06136MaRDI QIDQ6286790FDOQ6286790

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

Publication date: 17 May 2017

Abstract: In this paper, we provide Algebraic-Coding necessary and sufficient conditions for the Maximum Distance Separable Conjecture to hold.

Mathematics Subject Classification ID

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

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 Q6286790)