Rate-Distortion for ranking with incomplete information Academic Article uri icon


  • Abstract: We study the rate-distortion relationship in the set of permutations endowed with the Kendall Tau metric and the Chebyshev metric. Our study is motivated by the application of permutation rate-distortion to the average-case and worst-case analysis of algorithms for ranking with incomplete information and approximate sorting algorithms. For the Kendall Tau 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. Subjects: Information Theory (cs. IT) Cite as: arXiv: 1401.3093 [cs. IT](or arXiv: 1401.3093 v1 [cs. IT] for this version) Submission history From: Farzad Farnoud (Hassanzadeh)[view email][v1] Tue, 14 Jan 2014 07: 50: 07 GMT (274kb)

publication date

  • January 1, 2014

published in