Tight Exponential Strong Converse for Source Coding Problem with Encoded Side Information (2209.10275v3)
Abstract: 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 such that the side-information does not exists, we demonstrate that our tight exponent of the WAK problem reduces to the known tight expression of that special case while Oohama's lower bound is strictly loose. 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. A technical innovation of this paper is recognizing that the soft Markov constraint is a part of the exponent, rather than a penalty term that should be vanished. In fact, via numerical experiment, we provide evidence that the soft Markov constraint is strictly positive. The achievability part is derived by a careful analysis of the type argument; however, unlike the conventional analysis for the achievable rate region, we need to derive the soft Markov constraint in the analysis of the correct probability. Furthermore, we present an application of our derivation of strong converse exponent to the privacy amplification.
- “Source coding with side information and a converse for degraded broadcast channels” In IEEE Transactions on Information Theory 21.6, 1975, pp. 629–637
- Rudolf Ahlswede, Péter Gács and János Körner “Bounds on conditional probabilities with applications in multi-user communication” In Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 34, 1976, pp. 157–177
- Mehrasa Ahmadipour, Michèle Wigger and Shlomo Shamai “Strong Converses for Memoryless Bi-Static ISAC” In 2023 IEEE International Symposium on Information Theory, 2023, pp. 1818–1823
- S. Arimoto “On the converse to the coding theorem for discrete memoryless channels (Corresp.)” In IEEE Transactions on Information Theory 19.3, 1973, pp. 357–359
- “Generalized privacy amplification” In IEEE Transactions on Information Theory 41.6, 1995, pp. 1915–1923
- Charles H. Bennett, Gilles Brassard and Jean-Marc Robert “Privacy Amplification by Public Discussion” In SIAM Journal on Computing 17.2, 1988, pp. 210–229
- “Information Theory: Coding Theorems for Discrete Memoryless Systems” Cambridge University Press, 2011
- “Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)” In IEEE Transactions on Information Theory 25.1, 1979, pp. 82–85
- “A strong converse for a collection of network source coding problems” In 2009 IEEE International Symposium on Information Theory, 2009, pp. 2316–2320
- Mustapha Hamad, Michèle Wigger and Mireille Sarkiss “Strong Converses Using Typical Changes of Measures and Asymptotic Markov Chains” In IEEE Transactions on Information Theory 70.3, 2024, pp. 1720–1737
- Te Sun Han “Information-Spectrum Methods in Information Theory” Springer, 2003
- Masahito Hayashi “Quantum Information: An Introduction” Springer, 2006
- Sharu Theresa Jose and Ankur A. Kulkarni “Linear programming based finite blocklength converses for some network-like problems” In 2017 IEEE Information Theory Workshop, 2017, pp. 544–548
- Sharu Theresa Jose and Ankur A. Kulkarni “Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming” In IEEE Transactions on Information Theory 65.4, 2019, pp. 2423–2441
- “General broadcast channels with degraded message sets” In IEEE Transactions on Information Theory 23.1, 1977, pp. 60–64
- “Strong Converses are Just Edge Removal Properties” In IEEE Transactions on Information Theory 65.6, 2019, pp. 3315–3339
- Jingbo Liu, Ramon Handel and Sergio Verdú “Second-order converses via reverse hypercontractivity” In Math. Stat. Learn. 2.2, 2019, pp. 103–163
- Y. Oohama and Te Sun Han “Universal coding for the Slepian-Wolf data compression system and the strong converse theorem” In IEEE Transactions on Information Theory 40.6, 1994, pp. 1908–1919
- Yasutada Oohama “Exponent function for asymmetric broadcast channels at rates outside the capacity region” In 2016 International Symposium on Information Theory and Its Applications, 2016, pp. 537–541
- Yasutada Oohama “Exponential Strong Converse for Source Coding with Side Information at the Decoder” In Entropy 20.5, 2018
- Yasutada Oohama “Exponential Strong Converse for One Helper Source Coding Problem” In Entropy 21.6, 2019
- Renato Renner “Security of quantum key distribution” In Int. J. Quantum Inf. 6.1, 2008, pp. 1–127
- “Information Theoretic Security for Shannon Cipher System under Side-Channel Attacks” In Entropy 21.5, 2019
- “Strong Converse for Testing Against Independence over a Noisy channel” In 2020 IEEE International Symposium on Information Theory, 2020, pp. 1283–1288
- “Strong Converse Using Change of Measure Arguments” In IEEE Transactions on Information Theory 66.2, 2020, pp. 689–703
- “Information-theoretic Cryptography” Cambridge University Press, 2023
- Shun Watanabe “A converse bound on Wyner-Ahlswede-Körner Network via Gray-Wyner network” In 2017 IEEE Information Theory Workshop, 2017, pp. 81–85
- Shun Watanabe “Second-Order Region for Gray-Wyner Network” In IEEE Transactions on Information Theory 63.2, 2017, pp. 1006–1018
- “Privacy amplification theorem for bounded storage eavesdropper” In 2012 IEEE Information Theory Workshop, 2012, pp. 177–181
- A. Wyner “On source coding with side information at the decoder” In IEEE Transactions on Information Theory 21.3, 1975, pp. 294–300
- “The rate-distortion function for source coding with side information at the decoder” In IEEE Transactions on Information Theory 22.1, 1976, pp. 1–10