English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The source coding problem with encoded side information is considered. Alower bound on the strong converse exponent has been derived by Oohama, but itstightness has not been clarified. In this paper, we derive a tight strongconverse exponent. The achievability part is derived by a careful analysis ofthe type argument. The converse part is proved by a judicious use of thechange-of-measure argument, which was introduced by Gu-Effros and furtherdeveloped by Tyagi-Watanabe. Interestingly, the soft Markov constraint, whichwas introduced by Oohama as a proof technique, is naturally incorporated intothe characterization of the exponent.

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