TY - GEN
T1 - Bounds for permutation rate-distortion
AU - Farnoud, Farzad
AU - Schwartz, Moshe
AU - Bruck, Jehoshua
PY - 2014/1/1
Y1 - 2014/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84906536521&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2014.6874784
DO - 10.1109/ISIT.2014.6874784
M3 - Conference contribution
AN - SCOPUS:84906536521
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 6
EP - 10
BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014
PB - Institute of Electrical and Electronics Engineers
T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014
Y2 - 29 June 2014 through 4 July 2014
ER -