Perfect codes in direct products of cycles—a complete characterization

Let be a direct product of cycles. It is known that for any r⩾1, and any n⩾2, each connected component of G contains a so-called canonical r-perfect code provided that each ℓi is a multiple of rn+n(r+1). Here we prove that up to a reasonably defined equivalence, these are the only perfect codes that exist.