Title
Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information.
Abstract
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 rate-distortion tuple outside the rate-distortion region of the k-user successive refinement problem with causal decoder side information, the joint excess-distortion probability approaches one exponentially fast. Our proof follows by judiciously adapting the recently proposed strong converse technique by Oohama using the information spectrum method, the variational form of the rate-distortion region and Holder's inequality. The lossy source coding problem with causal decoder side information considered by El Gamal and Weissman is a special case (<mml:semantics>k=1</mml:semantics>) of the current problem. Therefore, the exponential strong converse theorem for the El Gamal and Weissman problem follows as a corollary of our result.
Year
DOI
Venue
2019
10.3390/e21040410
ENTROPY
Keywords
Field
DocType
exponential strong converse,information spectrum method,successive refinement,causal side information
Discrete mathematics,Converse,Mathematical optimization,Exponential function,Successive refinement,Tuple,Converse theorem,Corollary,Mathematics,Special case,Exponential growth
Journal
Volume
Issue
ISSN
21
4
1099-4300
Citations 
PageRank 
References 
0
0.34
27
Authors
2
Name
Order
Citations
PageRank
Lin Zhou121.39
Alfred O. Hero III22600301.12