Abstract: Maximum Distance Separable (MDS) codes are those error - cor- rection codes that meet the singleton bound, thus they have the largest mini- mum distance possible. The main research problem is to find an upper bound on the length of the codewords when the alphabet size and dimension of the code are fixed.

This paper will present a new technique using the Partition Weight Enumerator for solving this problem in some cases.