Lee distance: Difference between revisions

Content deleted Content added

Inline

Revision as of 08:14, 2 May 2015

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 it is 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

^ ^a ^b Deza, E.; Deza, M. (2014), Dictionary of Distances (3rd ed.), Elsevier, p. 52, ISBN 9783662443422
^ Richard E. Blahut (2008). Algebraic Codes on Lines, Planes, and Curves: An Engineering Approach. Cambridge University Press. p. 108. ISBN 978-1-139-46946-3.
^ Ron Roth (2006). Introduction to Coding Theory. Cambridge University Press. p. 314. ISBN 978-0-521-84504-5.
^ ^a ^b Marcus Greferath (2009). "An Introduction to Ring-Linear Coding Theory". Gröbner Bases, Coding, and Cryptography. Springer Science & Business Media. p. 220. ISBN 978-3-540-93806-4. {{cite book}}: Unknown parameter |editors= ignored (|editor= suggested) (help)

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, E. R. (1968), Algebraic Coding Theory, McGraw-Hill.

[Deza-1] Deza, E.; Deza, M. (2014), Dictionary of Distances (3rd ed.), Elsevier, p. 52, ISBN 9783662443422

[Blahut2008-2] Richard E. Blahut (2008). Algebraic Codes on Lines, Planes, and Curves: An Engineering Approach. Cambridge University Press. p. 108. ISBN 978-1-139-46946-3.

[Roth2006-3] Ron Roth (2006). Introduction to Coding Theory. Cambridge University Press. p. 314. ISBN 978-0-521-84504-5.

[Greferath2009-4] Marcus Greferath (2009). "An Introduction to Ring-Linear Coding Theory". Gröbner Bases, Coding, and Cryptography. Springer Science & Business Media. p. 220. ISBN 978-3-540-93806-4. {{cite book}}: Unknown parameter |editors= ignored (|editor= suggested) (help)

[1]

[2]

[3]

[4]

@@ Line 6: / Line 6: @@
 Considering the alphabet as the additive group [[modulo arithmetic|'''Z'''<sub>''q''</sub>]], 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.<ref name="Blahut2008">{{cite book|author=Richard E. Blahut|title=Algebraic Codes on Lines, Planes, and Curves: An Engineering Approach|year=2008|publisher=Cambridge University Press|isbn=978-1-139-46946-3|page=108}}</ref>
-If ''q''&nbsp;=&nbsp;2 the Lee distance coincides with the [[Hamming distance]].
+If ''q''&nbsp;=&nbsp;2 or ''q''&nbsp;=&nbsp;3 the Lee distance coincides with the [[Hamming distance]].
 The [[metric space]] induced by the Lee distance is a discrete analog of the [[Elliptic geometry|elliptic space]].<ref name="Deza">{{Citation|last1=Deza|first1=E.|first2=M.|last2=Deza|author2-link=Michel Deza|title=Dictionary of Distances|year=2014|edition=3rd|publisher=Elsevier|isbn=9783662443422|page=52}}</ref>