One of the most complete references on Hamming distances and coding in
general was written by Hamming:
Richard Hamming, Coding and Information Theory, Prentice-Hall,
1980 ISBN 0-13-139139-9.
Lee distances have been of interest since 1994, mainly due to the
following paper which discusses Lee codes and their relation:
A. Roger Hammons, Jr. P. Vikay Kumar, A.R. Calderbank, N.J.A.
Sloane and Patrick Solé, The Z4-linearity of Kerdock,
Preparata, Goethals, and related codes, IEEE Transactions on
Information Theory, 40(2):301-319, 1994.
The Lee distance is been found useful in other contexts, for example:
B. Bose, B. Brong, Y. Kwon and Y. Ashir, Lee Distance and
topological properties of k-ary n-cubes, IEEE Transactions on Computers
44 (1995) 1021-1030
A CSP model is presented in:
A. M. Frisch, C. Jefferson, I. Miguel, "Constraints for Breaking
More Row and Column Symmetries," Proceedings of the 9th International
Conference on Principles and Practice of Constraint Programming, 2003.