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. The achievability part is derived by a careful analysis of the type argument. The converse part is proved by a judicious use of the change-of-measure argument, which was introduced by Gu-Effros and further developed by Tyagi-Watanabe. Interestingly, the soft Markov constraint, which was introduced by Oohama as a proof technique, is naturally incorporated into the characterization of the exponent.

翻译：本文考虑含编码边信息的信源编码问题。Oohama已推导出该问题的强逆指数下界，但其紧致性尚未明确。本文给出紧致的强逆指数。可达性部分通过精细的类型分析得到，逆部分则通过巧妙运用Gu-Effros提出并由Tyagi-Watanabe进一步发展的测度变换论证证明。值得注意的是，Oohama作为证明技巧引入的软马尔可夫约束，被自然地纳入该指数的刻画中。