Recall that a maximum distance separable (MDS) code is one that achieves the Singleton bound d=n-k+1. Let C be a linear (n,k,d)_(q) code over F_(q).
(a) Prove that C is MDS if and only if every set of k coordinate positions has the following
property: Every ordered k-tuple (x_(1),x_(2),dots,x_(k)) with x_(i)inF_(q) for i=1,.....,k, appears in the k coordinate positions in exactly one codeword.
(b) Show that C is MDS if and only if its dual code is MDS. (Here, we assume that k < n.)
Recall that a maximum distance separable (MDS) code is one that achieves the Singleton bound d = n -- k + 1. Let C be a linear (n, k, d)q code over Fq
(a) Prove that C is MDS if and only if every set of k coordinate positions has the following property: Every ordered k-tuple (1,2,...,k) with x; e Fq for i = 1,...,k, appears in the k coordinate positions in exactly one codeword.
(b) Show that C is MDS if and only if its dual code is MDS. (Here, we assume that k < n.)