Quasi-perfect Lee distance codes in Z/sub K//sup 2/
B. Almohammad, B. Bose · 2003
A construction of perfect/quasi-perfect Lee distance codes over Z/sub K//sup 2/ for any K is designed. The minimum distance and the covering radius of these codes are proved. Efficient decoding algorithms are investigated.