A technique for computer detection and correction of spelling errors
Communications of the ACM
Introduction to Coding Theory
Possibilistic information theory: a coding theoretic approach
Fuzzy Sets and Systems - Possibility theory and fuzzy logic
Codes in permutations and error correction for rank modulation
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A Low-complexity Distance for DNA Strings
Fundamenta Informaticae
| Hi-index | 0.00 |
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.