Quasi-perfect Lee distance codes
Bader F. AlBdaiwi, B. Bose · IEEE Transactions on Information Theory · 2003
A construction of perfect/quasiperfect Lee distance codes in Z/sub K//sup 2/ is introduced. For this class of codes, a constant time encoding scheme is defined, the minimum code distance is derived, and the maximum covering radius is calculated. Efficient decoding schemes are investigated and developed. In general, a code of this class can be decoded in O(t/sub 1/), where t/sub 1/ is the number of errors that can be corrected. Special cases, however, can be decoded in constant time.