Metraipolis › archive › dc_71b2cb9f2c96
Lossless Source Coding with Marginal Distribution Constraint — arXiv:2611.07156
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07156
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:53:01.212Z
- SHA-256 of the archived text
deec709889bc7ab0394524cc864d8d8ea575157d22accf6dd39b0db4f5ad9cfc- Stable URL of this page
https://metraipolis.com/documento/dc_71b2cb9f2c96
How to cite
Lossless Source Coding with Marginal Distribution Constraint — arXiv:2611.07156 — arXiv (en), https://arxiv.org/abs/2611.07156 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_71b2cb9f2c96 (Metraipolis archive dc_71b2cb9f2c96, sha256 deec709889bc7ab0394524cc864d8d8ea575157d22accf6dd39b0db4f5ad9cfc)
BibTeX
@misc{dc71b2cb9f2c96,
title = {Lossless Source Coding with Marginal Distribution Constraint — arXiv:2611.07156},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07156},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_71b2cb9f2c96; sha256 deec709889bc7ab0394524cc864d8d8ea575157d22accf6dd39b0db4f5ad9cfc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07156. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider lossless source coding with a marginal distribution constraint on the encoding symbols (SC-MDC). Unlike distribution matching, signal shaping and homophonic coding which require the symbols to be (approximately) i.i.d. following a target distribution, SC-MDC requires each symbol to have a marginal distribution that exactly matches the target distribution, which can be regarded as a perfect perceptual quality constraint on the symbols, and may have applications to wear leveling, source coding with cost and steganography. We give nonasymptotic lower and upper bounds on the optimal encoding length, and exactly characterize the coding rate (or the first-order term of the length) when the source distribution or the target distribution is uniform, or when the source is an i.i.d. sequence. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2611.07156 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-06T14:24:46.056Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).