Exact Expression for Information Distance
| Authors | |
|---|---|
| Publication date | 08-2017 |
| Journal | IEEE Transactions on Information Theory |
| Volume | Issue number | 63 | 8 |
| Pages (from-to) | 4725-4728 |
| Number of pages | 4 |
| Organisations |
|
| Abstract |
Information distance can be defined not only between two strings but also in a finite multiset of strings of cardinality greater than two. We determine a best upper bound on the information distance. It is exact, since the upper bound on the information distance for all multisets is the same as the lower bound for infinitely many multisets of each of infinitely many cardinalities, up to a constant additive term. |
| Document type | Article |
| Language | English |
| Related publication | Exact Expression For Information Distance |
| Published at | https://doi.org/10.1109/TIT.2017.2686883 |
| Published at | https://arxiv.org/abs/1410.7328 |
| Other links | https://www.scopus.com/pages/publications/85028971721 |
| Downloads |
1410.7328v10
(Accepted author manuscript)
|
| Permalink to this page | |