We investigate the lossy compression of the permutation space by analyzing the trade-off between the size of a source code and the distortion with respect to either Kendall tau distance or ℓ[subscript 1] distance of the inversion vectors. For both distortion measures, we characterize the rate-distortion functions and provide explicit code designs that achieve them. Finally, we provide bounds on the higher order terms in the codebook size when the distortion levels lead to degenerate code rates (0 or 1).United States. Air Force Office of Scientific Research (Grant FA9550-11-1-0183)National Science Foundation (U.S.) (Grant CCF-1017772
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Permutation arrays under the Kendall-$\tau$ metric have been considered for error-correcting codes. ...
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexi...
We investigate the lossy compression of permutations by analyzing the trade-off between the size of ...
We investigate lossy compression (source coding) of data in the form of permutations. This problem h...
In this paper, we investigate the problem of compression of data that are in the form of permutation...
We study the rate-distortion relationship in the set of permutations endowed with the Kendall Tau me...
Abstract—We study the rate-distortion relationship in the set of permutations endowed with the Kenda...
We charactrize and investigate the highest achievable exponential growth rate of the expected number...
We consider lossy compression of a binary symmetric source by means of a low-density generator-matri...
Classical rate-distortion theory requires specifying a source distribution. Instead, we analyze rate...
Abstract — Classical rate-distortion theory requires knowledge of an elusive source distribution. In...
We consider a novel variant of lossy coding in which the distortion measure is revealed only to the ...
AbstractMove-to-Front, Distance Coding and Inversion Frequencies are three simple and effective tech...
Abstract—Classical rate-distortion theory requires specifying a source distribution. Instead, we ana...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Permutation arrays under the Kendall-$\tau$ metric have been considered for error-correcting codes. ...
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexi...
We investigate the lossy compression of permutations by analyzing the trade-off between the size of ...
We investigate lossy compression (source coding) of data in the form of permutations. This problem h...
In this paper, we investigate the problem of compression of data that are in the form of permutation...
We study the rate-distortion relationship in the set of permutations endowed with the Kendall Tau me...
Abstract—We study the rate-distortion relationship in the set of permutations endowed with the Kenda...
We charactrize and investigate the highest achievable exponential growth rate of the expected number...
We consider lossy compression of a binary symmetric source by means of a low-density generator-matri...
Classical rate-distortion theory requires specifying a source distribution. Instead, we analyze rate...
Abstract — Classical rate-distortion theory requires knowledge of an elusive source distribution. In...
We consider a novel variant of lossy coding in which the distortion measure is revealed only to the ...
AbstractMove-to-Front, Distance Coding and Inversion Frequencies are three simple and effective tech...
Abstract—Classical rate-distortion theory requires specifying a source distribution. Instead, we ana...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Permutation arrays under the Kendall-$\tau$ metric have been considered for error-correcting codes. ...
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexi...