An Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2017
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911957241561088 |
|---|---|
| author | Damelin, Steven B. Kaiser, Daniel Sun, Jeffrey Bora, Safal |
| author_facet | Damelin, Steven B. Kaiser, Daniel Sun, Jeffrey Bora, Safal |
| contents | In this paper, we provide Algebraic-Coding necessary and sufficient conditions for the Maximum Distance Separable Conjecture to hold. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1705_06136 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | An Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture Damelin, Steven B. Kaiser, Daniel Sun, Jeffrey Bora, Safal Number Theory 94B05, 05B35, 12Y05 In this paper, we provide Algebraic-Coding necessary and sufficient conditions for the Maximum Distance Separable Conjecture to hold. |
| title | An Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture |
| topic | Number Theory 94B05, 05B35, 12Y05 |
| url | https://arxiv.org/abs/1705.06136 |