Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Spearman footrule distance

Sortuj według:

Ogranicz wyniki do:

Spearman Permutation Distances and Shannon's Distinguishability

Bortolussi L., Dinu L.P., Sgarro A.

Fundamenta Informaticae

2012

Vol. 118, nr 3

245-252

Spearman distance is a permutation distance which might be used for codes in permutations beside Kendall distance. However, Spearman distance gives rise to a geometry of strings, which is rather unruly from the point of view of error correction and error detection. Special care has to be taken to discriminate between the two notions of codeword distance and codeword distinguishability. This stresses the importance of rejuvenating the latter notion, extending it from Shannon's zero-error information theory to the more general setting of metric string distances.