## Maximum distance separable codes in the $\rho$ metric over arbitrary alphabets

##### J. Algebr. Comb. 16(1), 71-81 (2002)
DOI: 10.1023/A:1020834531372

### Summary

Summary: We give a bound for codes over an arbitrary alphabet in a non-Hamming metric and define MDS codes as codes meeting this bound. We show that MDS codes are precisely those codes that are uniformly distributed and show that their weight enumerators based on this metric are uniquely determined.

### Keywords/Phrases

MDS codes, uniform distributions