|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 6 of 7 found articles
| Title: |
Spearman Permutation Distances and Shannon's Distinguishability |
| Author: |
Bortolussi, Luca Dinu, Liviu P. Sgarro, Andrea |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 118 (2012) nr. 3 pages 245-252 |
| Year: |
2012-06-08 |
| Contents: |
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. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 6 of 7 found articles
| << previous | next >> |