Lee distance 李距离
In coding theory, the Lee distance is a distance between two strings
and
of equal length n over the q-ary alphabet {0, 1, …, q − 1} of size q ≥ 2.
It is a metric, defined as
Considering the alphabet as the additive group Zq, the Lee distance between two letters is the length of shortest path in the Cayley graph (which is circular since the group is cyclic) between them.