Lee distance
In coding theory, the Lee distance is a distance between two strings and of equal length n over the q-ary alphabet Template:Math} of size Template:Math. It is a metric[1] defined as If Template:Math or Template:Math the Lee distance coincides with the Hamming distance, because both distances are 0 for two single equal symbols and 1 for two single non-equal symbols. For Template:Math this is not the case anymore; the Lee distance between single letters can become bigger than 1. However, there exists a Gray isometry (weight-preserving bijection) between with the Lee weight and with the Hamming weight.[2]
Considering the alphabet as the additive group Zq, the Lee distance between two single letters and is the length of shortest path in the Cayley graph (which is circular since the group is cyclic) between them.[3] More generally, the Lee distance between two strings of length Template:Mvar is the length of the shortest path between them in the Cayley graph of . This can also be thought of as the quotient metric resulting from reducing Template:Math with the Manhattan distance modulo the lattice Template:Math. The analogous quotient metric on a quotient of Template:Math modulo an arbitrary lattice is known as a Template:Visible anchor or Mannheim distance.[4][5]
The metric space induced by the Lee distance is a discrete analog of the elliptic space.[1]
Example
If Template:Math, then the Lee distance between 3140 and 2543 is Template:Math.
History and application
The Lee distance is named after William Chi Yuan Lee (Template:Lang). It is applied for phase modulation while the Hamming distance is used in case of orthogonal modulation.
The Berlekamp code is an example of code in the Lee metric.[6] Other significant examples are the Preparata code and Kerdock code; these codes are non-linear when considered over a field, but are linear over a ring.[2]
References
- ↑ 1.0 1.1 Template:Citation
- ↑ 2.0 2.1 Template:Cite book
- ↑ Template:Cite book
- ↑ Template:Cite journal [1][2] (1+10 pages) (NB. This work was partially presented at CDS-92 Conference, Kaliningrad, Russia, on 1992-09-07 and at the IEEE Symposium on Information Theory, San Antonio, TX, USA.)
- ↑ Template:Cite conference (5/8 pages) [3]
- ↑ Template:Cite book