Lesson plan
Lee distance
In coding theory, the Lee distance is a distance between two strings x_1 x_2 \dots x_n and y_1 y_2 \dots y_n of equal length n over the q-ary alphabet of size . It is a metric defined as \sum_{i=1}^n \min(|x_i - y_i|,\, q - |x_i - y_i|). If or 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 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 \mathbb{Z}_4 with the Lee weight and \mathbb{Z}_2^2 with the Hamming weight. Considering the alphabet as the additive group Z q , the Lee distance between two single letters x and y is the length of shortest path in the Cayley graph (which is circular since the group is cyclic) between them. More generally, the Lee distance between two strings of length is the length of the shortest path between them in the Cayley graph of \mathbf{Z}_q^n . This can also be thought of as the quotient metric resulting from reducing with the Manhattan distance modulo the lattice . The analogous quotient metric on a quotient of modulo an arbitrary lattice is known as a or Mannheim distance. The metric space induced by the Lee distance is a discrete analog of the elliptic space.
Article summary
In coding theory, the Lee distance is a distance between two strings x_1 x_2 \dots x_n and y_1 y_2 \dots y_n of equal length n over the q-ary alphabet of size . It is a metric defined as \sum_{i=1}^n \min(|x_i - y_i|,\, q - |x_i - y_i|). If or 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 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 \mathbb{Z}_4 with the Lee weight and \mathbb{Z}_2^2 with the Hamming weight. Considering the alphabet as the additive group Z q , the Lee distance between two single letters x and y is the length of shortest path in the Cayley graph (which is circular since the group is cyclic) between them. More generally, the Lee distance between two strings of length is the length of the shortest path between them in the Cayley graph of \mathbf{Z}_q^n . This can also be thought of as the quotient metric resulting from reducing with the Manhattan distance modulo the lattice . The analogous quotient metric on a quotient of modulo an arbitrary lattice is known as a or Mannheim distance. The metric space induced by the Lee distance is a discrete analog of the elliptic space.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.