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...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on information theory Ročník 71; číslo 3; s. 1533 - 1545
Hlavní autoři:	Takeuchi, Daisuke, Watanabe, Shun
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 01.03.2025
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!