The paper presents exponentially-strong converses for source-coding, channel coding, and hypothesis testing problems. More specifically, it presents alternative proofs for the well-known exponentially-strong converse bounds for almost lossless source-coding with side-information and for channel coding over a discrete memoryless channel (DMC). These alternative proofs are solely based on a change of measure argument on the sets of conditionally or jointly typical sequences that result in a correct decision, and on the analysis of these measures in the asymptotic regime of infinite blocklengths. The paper also presents a new exponentially-strong converse for the K-hop hypothesis testing against independence problem with certain Markov chains and a strong converse for the two-terminal Lround interactive compression problem with multiple distortion constraints that depend on both sources and both reconstructions. This latter problem includes as special cases the Wyner-Ziv problem, the interactive function computation problem, and the compression with lossy common reconstruction problem. These new strong converse proofs are derived using similar change of measure arguments as described above and by additionally proving that certain Markov chains involving auxiliary random variables hold in the asymptotic regime of infinite blocklengths. As shown in related publications, the same method also yields converse bounds under expected resource constraints.

翻译：本文展示了源码、频道编码和假设测试问题的指数强反调。 更具体地说, 本文还展示了众所周知的极强反差反差的反差参数, 用于使用侧信息进行几乎无损源码的几乎无损源码, 并用于在离散的无内存通道( DMC) 上进行频道编码。 这些替代证据完全基于对一系列有条件或共同典型序列的计量参数的改变,导致正确决定,以及对这些措施的分析。 这些新的强烈反差证据是使用上述类似计量参数的类似变化和通过进一步证明某些马尔科夫链对独立问题进行K-hop假设测试的新的超强反差反差值,以及双端互动压缩问题的强烈反差,而两者都取决于来源和两者的重建。 后一种问题包括:关于Wyner-Ziv问题、交互函数计算问题和与损失常见重建问题的压缩的特殊案例。 这些新的强烈反差证据是使用上述测量参数的类似变化, 并用其他证据来证明某些马可夫假说, 。