(r,k)-catching code

A collection of r_words on an alphabet of n letters is called (r,k)_catching code if for every r_word w there is one selected member v such that v coincides with w in at least k places. How large is the smallest size of the (r,k)_catching code and how to find the minimal (r,k)_\%catching code? Some methods are advanced to construct such codes.