Tight Exponential Strong Converse for Source Coding Problem With Encoded Side Information

The source coding problem with encoded side information is considered. A lower bound on the strong converse exponent has been derived by Oohama, but its tightness has not been clarified. In this paper, we derive a tight strong converse exponent. For the special case where the side-information does n...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 71; no. 3; pp. 1533 - 1545
Main Authors:	Takeuchi, Daisuke, Watanabe, Shun
Format:	Journal Article
Language:	English
Published:	IEEE 01.03.2025
Subjects:	Atmospheric measurements change of measure argument Channel coding Decoding Error probability exponent of correct probability Hands Lower bound network information theory Particle measurements Privacy Random variables Source coding Source coding with side information strong converse theorem
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!