Successive Refinement for Lossy Compression of Individual Sequences
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915169621245952 |
|---|---|
| author | Merhav, Neri |
| author_facet | Merhav, Neri |
| contents | We consider the problem of successive-refinement coding for lossy compression of individual sequences, namely, compression in two stages, where in the first stage, a coarse description at a relatively low rate is sent from the encoder to the decoder, and in the second stage, additional coding rate is allocated in order to refine the description and thereby improve the reproduction. Our main result is in establishing outer bounds (converse theorems) for the rate region where we limit the encoders to be finite-state machines in the spirit of Ziv and Lempel's 1978 model.The matching achievability scheme is conceptually straightforward. We also consider the more general multiple description coding problem on a similar footing and propose achievability schemes that are analogous to the well-known El Gamal-Cover and the Zhang-Berger achievability schemes of memoryless sources and additive distortion measures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_16869 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Successive Refinement for Lossy Compression of Individual Sequences Merhav, Neri Information Theory We consider the problem of successive-refinement coding for lossy compression of individual sequences, namely, compression in two stages, where in the first stage, a coarse description at a relatively low rate is sent from the encoder to the decoder, and in the second stage, additional coding rate is allocated in order to refine the description and thereby improve the reproduction. Our main result is in establishing outer bounds (converse theorems) for the rate region where we limit the encoders to be finite-state machines in the spirit of Ziv and Lempel's 1978 model.The matching achievability scheme is conceptually straightforward. We also consider the more general multiple description coding problem on a similar footing and propose achievability schemes that are analogous to the well-known El Gamal-Cover and the Zhang-Berger achievability schemes of memoryless sources and additive distortion measures. |
| title | Successive Refinement for Lossy Compression of Individual Sequences |
| topic | Information Theory |
| url | https://arxiv.org/abs/2502.16869 |