arXiv · 1705.06136
An Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture
Abstract
In this paper, we provide Algebraic-Coding necessary and sufficient conditions for the Maximum Distance Separable Conjecture to hold.
Explore related subjects
Keep this discovery
Steven B. Damelin, Daniel Kaiser, Jeffrey Sun, Safal Bora. 2017-05-17. An Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture. https://doi.org/10.2140/involve.2024.17.363
Cite the original work for its findings. Save a collection to share your selection of sources.