Lee distance
id:
lee-distance-275-13878081
title:
Lee distance
text:
In coding theory, the Lee distance is a distance between two strings x 1 x 2 … x n and y 1 y 2 … 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 If q = 2 or q = 3 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 q > 3 this is not the case anymore; the Lee distance between single letters can become bigger than 1. However, there exists a
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Lee_distance
date created:
date modified:
2024-04-16T22:12:16Z
main entity:
{"identifier":"Q6515692","url":"https://www.wikidata.org/entity/Q6515692"}
image:
fields total:
13
integrity:
13