1 problem

0 votes0 replies2 views
The MDS conjecture on the maximum length of non-trivial MDS codes
Let $q$ be the alphabet size, and let $k$ be the dimension of an MDS code with minimum distance $d$ . A code is non-trivial when $d>2$ . MDS conjecture. There are no non-trivial MDS…
Conjectureopencoding-theory mcd-codesarXiv posted 3 days ago

The MDS conjecture on the maximum length of non-trivial MDS codes