On perfect 1-$\mathcal E$-error-correcting codes

Abstract

We generalize the concept of perfect Lee-error-correcting codes, and present constructions of this new class of perfect codes that are called perfect 1-$\mathcal{E}$-error-correcting codes. We also show that in some cases such codes contain quite a few perfect 1-error-correcting $q$-ary Hamming codes as subsets.