Nearly perfect codes in distance-regular graphs

The idea of a nearly perfect code in a vector space over a binary field is generalized to the class of distance-regular graphs. A necessary condition for the existence of a nearly perfect code in a distance-regular graph is obtained, and it is shown that this condition implies the analogous result in the classical binary case.