Published February 2016
| public
Journal Article
Bounds for Permutation Rate-Distortion
Abstract
We study the rate-distortion relationship in the set of permutations endowed with the Kendall t-metric and the Chebyshev metric. Our study is motivated by the application of permutation rate-distortion to the average-case and worst-case distortion analysis of algorithms for ranking with incomplete information and approximate sorting algorithms. For the Kendall τ-metric we provide bounds for small, medium, and large distortion regimes, while for the Chebyshev metric we present bounds that are valid for all distortions and are especially accurate for small distortions. In addition, for the Chebyshev metric, we provide a construction for covering codes.
Additional Information
© 2015 IEEE. Manuscript received November 19, 2014; revised September 13, 2015; accepted November 16, 2015. Date of publication December 4, 2015; date of current version January 18, 2016. This work was supported in part by the National Science Foundation under Grant CIF-1218005 and in part by the Israel Science Foundation under Grant 130/14. This paper was presented in part at the 2014 IEEE International Symposium on Information Theory. The authors would like to thank the associate editor and anonymous reviewers, whose comments helped improve the presentation of the paper.Additional details
- Eprint ID
- 63776
- DOI
- 10.1109/TIT.2015.2504521
- Resolver ID
- CaltechAUTHORS:20160119-151223798
- CIF-1218005
- NSF
- 130/14
- Israeli Science Foundation
- Created
-
2016-01-19Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field