Affiliations: Dept. of Mathematics and Geosciences, University of Trieste, Italy, luca.bortolussi@gmail.com | University of Bucharest, Faculty of Mathematics and Computer Science, Academiei 14, 010014, Bucharest, Romania, ldinu@fmi.unibuc.ro | Dept. of Mathematics and Geosciences, University of Trieste, Italy, sgarro@units.it
Note: [] Address for correspondence: University of Bucharest, Faculty of Mathematics and Computer Science, Academiei 14, 010014, Bucharest, Romania
Abstract: 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.
