Return to Question

Is there a code that is Maximum Distance Separable and not isomorphic to Reed Solomon Codes? When is a MDS code isomorphic to Reed Solomon Code?

Is there an easy test? If so, could someone provide me a reference?

In short, if given a $[n,k,n-k+1]_q$ code how do you show it is RS or not?

How many non-isomorphic $[n,k,n-k+1]_q$ MDS codes are there (note this question provides an upper bound to the complexity of identification of RS codes)?

Is there a code that is Maximum Distance Separable and not isomorphic to Reed Solomon Codes? When is a MDS code isomorphic to Reed Solomon Code?

Is there an easy test? If so, could someone provide me a reference?

In short, if given a $[n,k,n-k+1]_q$ code how do you show it is RS or not?

Is there a code that is Maximum Distance Separable and not isomorphic to Reed Solomon Codes? When is a MDS code isomorphic to Reed Solomon Code? Is there an easy test? If so, could someone provide me a reference?

In short, if given a $[n,k,n-k+1]_q$ code how do you show it is RS or not?

Is there a code that is Maximum Distance Separable and not isomorphic to Reed Solomon Codes? When is a MDS code isomorphic to Reed Solomon Code? 

Is there an easy test? If so, could someone provide me a reference?

In short, if given a $[n,k,n-k+1]_q$ code how do you show it is RS or not?

How many non-isomorphic $[n,k,n-k+1]_q$ MDS codes are there (note this question provides an upper bound to the complexity of identification of RS codes)?