Let GF(q) be the finite field of q = pa elements, where p is a prime. Let V be the vector space (GF(q))< The minimum distance drain of a set C _C V is defined as the smallest Hamming distance between different vectors of C. The greatest integer ~ 1, a set C _C V is called an e-error-correcting q-ary code, if ] C I, the cardinality of C, is />2 and e = [(dmin 1)/2]....