Timeline for On MDS code property
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 1, 2013 at 11:35 | comment | added | Turbo | Actually does Ghorpade's work tell number of MDS codes or number of non-isomorphic MDS codes? | |
| Nov 1, 2013 at 11:28 | vote | accept | Turbo | ||
| Nov 1, 2013 at 11:28 | comment | added | Turbo | @YuichiroFujiwara Actually I found number of mds codes in Ghorpade's work ac.els-cdn.com/S1071579700902995/… | |
| Nov 1, 2013 at 11:25 | comment | added | Peter Mueller | An interesting example are the $[10,5,6]_9$ Glynn codes which are quite different from Reed-Solomon codes, see fma2.math.uni-magdeburg.de/~willems/papers/RS_GL3.ps | |
| Nov 1, 2013 at 11:02 | comment | added | Turbo | Actually I think the following question could provide an upper bound on the complexity? "How many non-isomorphic $[n,k,n-k+1]_q$ MDS codes are there?" | |
| Nov 1, 2013 at 10:47 | comment | added | Yuichiro Fujiwara | @JAS The simplest way is to see if your code is linear or not. If it's not linear, it can't be a Reed-Solomon code. If it's linear, the weight distributions are all the same across (linear) MDS codes for a given length, dimension, and alphabet size. So, I doubt there is an extremely elementary way to distinguish two MDS codes, although I could be wrong. | |
| Nov 1, 2013 at 10:45 | comment | added | Turbo | Also is there a simple test that tells when a MDS code is Reed-Solomon? | |
| Nov 1, 2013 at 10:03 | history | answered | Yuichiro Fujiwara | CC BY-SA 3.0 |