EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Universal Random Coding Ensemble for Sample-Wise Lossy Compression

Neri Merhav iD

Entropy · 11.08.2023 · 25 (8) · 1199

DOI: 10.3390/e25081199 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 11.08.2023. Verfasst von Neri Merhav. Beteiligte Einrichtung: The Viterbi Faculty of Electrical and Computer Engineering, Technion-Israel Institute of Technology, Technion City, Haifa 3200003, Israel. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We propose a universal ensemble for the random selection of rate–distortion codes which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector, x^, is selected independently at random under the probability distribution that is proportional to 2−LZ(x^), where LZ(x^) is the code length of x^ pertaining to the 1978 version of the Lempel–Ziv (LZ) algorithm. We show that, with high probability, the resulting codebook gives rise to an asymptotically optimal variable-rate lossy compression scheme under an arbitrary distortion measure, in the sense that a matching converse theorem also holds. According to the converse theorem, even if the decoder knew the ℓ-th order type of source vector in advance (ℓ being a large but fixed positive integer), the performance of the above-mentioned code could not have been improved essentially for the vast majority of codewords pertaining to source vectors in the same type. Finally, we present a discussion of our results, which includes among other things, a clear indication that our coding scheme outperforms the one that selects the reproduction vector with the shortest LZ code length among all vectors that are within the allowed distortion from the source vector.

Schlagwörter

Stichwörter der Autor:innen

LZ algorithmcode ensemblecumulant generating functionlossy compressionrandom codingrate–distortionsource codinguniversal codinguniversal distribution

Autor:innen und Institutionen

  • The Viterbi Faculty of Electrical and Computer Engineering, Technion-Israel Institute of Technology, Technion City, Haifa 3200003, Israel.

ORCID-Profile: Neri Merhav

Zitieren

APA

Merhav, N. (2023). A Universal Random Coding Ensemble for Sample-Wise Lossy Compression. Entropy, 25(8), 1199. https://doi.org/10.3390/e25081199

Vancouver

Merhav N. A Universal Random Coding Ensemble for Sample-Wise Lossy Compression. Entropy. 2023;25(8):1199. doi:10.3390/e25081199

BibTeX
@article{Merhav2023,
  author = {Merhav, Neri},
  title = {A Universal Random Coding Ensemble for Sample-Wise Lossy Compression},
  journal = {Entropy},
  year = {2023},
  volume = {25},
  number = {8},
  pages = {1199},
  doi = {10.3390/e25081199}
}
Kostenlos starten →