Cargando…
Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information †
We consider the k-user successive refinement problem with causal decoder side information and derive an exponential strong converse theorem. The rate-distortion region for the problem can be derived as a straightforward extension of the two-user case by Maor and Merhav (2008). We show that for any r...
Autores principales: | Zhou, Lin, Hero, Alfred |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514900/ https://www.ncbi.nlm.nih.gov/pubmed/33267124 http://dx.doi.org/10.3390/e21040410 |
Ejemplares similares
-
Exponential Strong Converse for Source Coding with Side Information at the Decoder †
por: Oohama, Yasutada
Publicado: (2018) -
Exponential Strong Converse for One Helper Source Coding Problem †
por: Oohama, Yasutada
Publicado: (2019) -
Information-Geometric Approach for a One-Sided Truncated Exponential Family
por: Yoshioka, Masaki, et al.
Publicado: (2023) -
DIR-Net: Deep Residual Polar Decoding Network Based on Information Refinement
por: Song, Bixue, et al.
Publicado: (2022) -
Exact and Soft Successive Refinement of the Information Bottleneck
por: Charvin, Hippolyte, et al.
Publicado: (2023)