All Nearly Perfect Codes are KnownKauko LindströmInformation and Control1977Let 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… (More)