EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Universal Random Coding for Successive Refinement of Individual Sequences Based on Lempel–Ziv Complexity

Neri Merhav

Entropy · 25.10.2026 · 28 (11) · 1176

DOI: 10.3390/e28111176 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 25.10.2026. Verfasst von Neri Merhav. Die Arbeit nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This work extends an earlier proposed universal random-coding ensemble for sample-wise lossy compression of individual sequences to the two-stage (successive-refinement) setting—an extension that is not quite straightforward, as explained in the sequel. The construction has three layers. First, a complete, self-contained direct/converse match in the language of type classes and typical sequences, a two-stage analogue of Rimoldi’s classical characterization (applied in the superalphabet of blocks). Second, a realization of the same rates via a random-coding scheme built from the Lempel–Ziv (LZ78) complexity rather than the type-class uniform measure the first layer relies on, since an LZ-based ensemble is universal across source statistics and distortion measures, carries no block-length parameter in the codebook itself and is directly implementable. Third, we give a fully type-free achievability construction (no joint types of ℓ-vectors appear anywhere in its search criterion) and show it matches the same converse exactly, reaching every point of the achievable region: the same converse from the first layer already binds any code, type-free schemes included, so no separate argument is needed to certify the match. We also describe (without proof) how to extend the type-free construction to any fixed number r>2 of stages. Finally, we show this paper’s achievable region is a superset of the one obtained by a companion paper, which is based on a finite-state modeling approach to a similar two-stage problem, extending a known single-stage domination result to two stages.

Zitieren

APA

Merhav, N. (2026). Universal Random Coding for Successive Refinement of Individual Sequences Based on Lempel–Ziv Complexity. Entropy, 28(11), 1176. https://doi.org/10.3390/e28111176

Vancouver

Merhav N. Universal Random Coding for Successive Refinement of Individual Sequences Based on Lempel–Ziv Complexity. Entropy. 2026;28(11):1176. doi:10.3390/e28111176

BibTeX
@article{Merhav2026,
  author = {Merhav, Neri},
  title = {Universal Random Coding for Successive Refinement of Individual Sequences Based on Lempel–Ziv Complexity},
  journal = {Entropy},
  year = {2026},
  volume = {28},
  number = {11},
  pages = {1176},
  doi = {10.3390/e28111176}
}
Kostenlos starten →