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 {0, 1, …, q − 1} of size q ≥ 2. It is a metric, defined as

\sum_{i=1}^n \min(|x_i-y_i|,q-|x_i-y_i|).

^[1]

Considering the alphabet as the additive group Z_q, 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.^[2]

If q = 2 or q = 3 the Lee distance coincides with the Hamming distance.

The metric space induced by the Lee distance is a discrete analog of the elliptic space.^[1]

Example

If q = 6, then the Lee distance between 3140 and 2543 is 1 + 2 + 0 + 3 = 6.

History and application

The Lee distance is named after C. Y. Lee. 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.^[3] 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.^[4]

Also, there exists a Gray isometry (bijection preserving weight) between $\mathbb{Z}_4$ with the Lee weight and $\mathbb{Z}_2^2$ with the Hamming weight.^[4]

References

1 2 Deza, Elena; Deza, Michel (2014), Dictionary of Distances (3rd ed.), Elsevier, p. 52, ISBN 9783662443422
↑ Blahut, Richard E. (2008). Algebraic Codes on Lines, Planes, and Curves: An Engineering Approach. Cambridge University Press. p. 108. ISBN 978-1-139-46946-3.
↑ Roth, Ron (2006). Introduction to Coding Theory. Cambridge University Press. p. 314. ISBN 978-0-521-84504-5.
1 2 Greferath, Marcus (2009). "An Introduction to Ring-Linear Coding Theory". In Sala, Massimiliano; Mora, Teo; Perret, Ludovic; Sakata, Shojiro; and Traverso, Carlo. Gröbner Bases, Coding, and Cryptography. Springer Science & Business Media. p. 220. ISBN 978-3-540-93806-4.

Lee, C. Y. (1958), "Some properties of nonbinary error-correcting codes", IRE Transactions on Information Theory 4 (2): 77–82, doi:10.1109/TIT.1958.1057446
Berlekamp, Elwyn R. (1968), Algebraic Coding Theory, McGraw-Hill
Voloch, Jose Felipe; Walker, Judy L. (1998). "Lee Weights of Codes from Elliptic Curves". In Vardy, Alexander. Codes, Curves, and Signals: Common Threads in Communications. Springer Science & Business Media. ISBN 978-1-4615-5121-8.

Strings

String metric	Approximate string matching Bitap algorithm Damerau–Levenshtein distance Edit distance Hamming distance Jaro–Winkler distance Lee distance Levenshtein automaton Levenshtein distance Wagner–Fischer algorithm

String searching algorithm	Apostolico–Giancarlo algorithm Boyer–Moore string search algorithm Boyer–Moore–Horspool algorithm Knuth–Morris–Pratt algorithm Rabin–Karp string search algorithm

Multiple string searching	Aho–Corasick Commentz-Walter algorithm Rabin–Karp

Regular expression	Comparison of regular expression engines List of regular expression software Regular tree grammar Thompson's construction Nondeterministic finite automaton

Sequence alignment	Hirschberg's algorithm Needleman–Wunsch algorithm Smith–Waterman algorithm

Data structures	DAFSA DAWG Suffix array Suffix automaton Suffix tree Generalized suffix tree Rope Ternary search tree Trie

Other	Parsing Pattern matching Compressed pattern matching Longest common subsequence Longest common substring Sequential pattern mining Sorting

This article is issued from Wikipedia - version of the Friday, November 27, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.