Recently Kondratyev and Trofimov obtained a theorem for binaryANcodes with distance not less than five. In this correspondence we prove that this theorem holds for arbitrary nonbinary radix. Noting that the generalization of Peterson's theorem on single-error-correcting binaryANcodes to nonbinary cases does not seem to be easily forthcoming the result described here is surprising.