{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:03:41Z","timestamp":1775016221164,"version":"3.50.1"},"reference-count":33,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1134\/s0032946019010046","type":"journal-article","created":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T05:15:52Z","timestamp":1556082952000},"page":"67-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound"],"prefix":"10.1134","volume":"55","author":[{"given":"S. L.","family":"Fong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Y. F.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"4346_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"A El Gamal","year":"2011","unstructured":"El Gamal, A. and Kim, Y.-H., Network Information Theory, Cambridge, UK: Cambridge Univ. Press, 2011."},{"key":"4346_CR2","unstructured":"El Gamal, A., On Information Flow in Relay Networks, in Proc. 1981 IEEE National Telecommunications Conf. (NTC\u201981), New Orleans, LA, Nov. 29\u2013Dec. 3, 1981, New York: IEEE, 1981, vol. 2, pp. D4.1.1\u2013D4.1.4."},{"key":"4346_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford Jr","year":"1956","unstructured":"Ford, L.R., Jr. and Fulkerson, D.R., Maximal Flow through a Network, Canad. J. Math., 1956, vol. 8, pp. 399\u2013404.","journal-title":"Canad. J. Math."},{"issue":"5","key":"4346_CR4","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","volume":"25","author":"T Cover","year":"1979","unstructured":"Cover, T. and El Gamal, A., Capacity Theorems for the Relay Channel, IEEE Trans. Inform. Theory., 1979, vol. 25, no. 5, pp. 572\u2013584.","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"3","key":"4346_CR5","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1109\/TIT.2008.2011518","volume":"55","author":"M Aleksic","year":"2009","unstructured":"Aleksic, M., Razaghi, P., and Yu, W., Capacity of a Class of Modulo-Sum Relay Channels, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 3, pp. 921\u2013930.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"4346_CR6","doi-asserted-by":"publisher","first-page":"3037","DOI":"10.1109\/TIT.2005.853304","volume":"51","author":"G Kramer","year":"2005","unstructured":"Kramer G., Gastpar M., Gupta P. Cooperative Strategies and Capacity Theorems for Relay Networks, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 9, pp. 3037\u20133063.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4346_CR7","series-title":"PhD Thesis","volume-title":"Information Flow in Relay Networks","author":"MR Aref","year":"1980","unstructured":"Aref, M.R., Information Flow in Relay Networks, PhD Thesis, Dept. of Statistics, Stanford Univ., CA, 1980."},{"issue":"3","key":"4346_CR8","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1109\/TIT.1982.1056502","volume":"28","author":"A El Gamal","year":"1982","unstructured":"El Gamal, A. and Aref, M.R., The Capacity of the Semideterministic Relay Channel, IEEE Trans. Inform. Theory, 1982, vol. 28, no. 3, pp. 536.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4346_CR9","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1109\/TIT.2005.846438","volume":"51","author":"A El Gamal","year":"2005","unstructured":"El Gamal, A. and Zahedi, S., Capacity of a Class of Relay Channels with Orthogonal Components, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 5, pp. 1815\u20131817.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"4346_CR10","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/TIT.2011.2110110","volume":"57","author":"AS Avestimehr","year":"2011","unstructured":"Avestimehr, A.S., Diggavi, S.N., and Tse, D.N.C., Wireless Network Information Flow: A Deterministic Approach, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 4, pp. 1872\u20131905.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4346_CR11","doi-asserted-by":"crossref","unstructured":"Behboodi, A. and Piantanida, P., On the Asymptotic Error Probability of Composite Relay Channels, in Proc. 2011 IEEE Int. Sympos. on Information Theory (ISIT\u20192011), St. Petersburg, Russia, July 31\u2013Aug. 5, 2011, pp. 1524\u20131528.","DOI":"10.1109\/ISIT.2011.6033798"},{"key":"4346_CR12","doi-asserted-by":"crossref","unstructured":"Behboodi, A. and Piantanida, P., On the Asymptotic Spectrum of the Error Probability of Composite Networks, in Proc. 2012 IEEE Information Theory Workshop (ITW\u20192012), Lausanne, Switzerland, Sept. 3\u20137, 2012, pp. 148\u2013152.","DOI":"10.1109\/ITW.2012.6404645"},{"key":"4346_CR13","series-title":"PhD Thesis","volume-title":"R\u00e9seaux coop\u00e9ratifs avec incertitude du canal (Cooperative Networks with Channel Uncertainty)","author":"A Behboodi","year":"2012","unstructured":"Behboodi, A., R\u00e9seaux coop\u00e9ratifs avec incertitude du canal (Cooperative Networks with Channel Uncertainty), PhD Thesis, Dept. of Telecommunications, Sup\u00e9lec (\u00c9cole Sup\u00e9rieure d\u2019\u00c9lectricit\u00e9), Gif-sur-Yvette, France, 2012. Available at http:\/\/tel.archives-ouvertes.fr\/tel-00765429."},{"key":"4346_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12066-8","volume-title":"Information-Spectrum Methods in Information Theory","author":"TS Han","year":"2003","unstructured":"Han, T.S., Information-Spectrum Methods in Information Theory, Berlin: Springer, 2003."},{"issue":"9","key":"4346_CR15","doi-asserted-by":"publisher","first-page":"4953","DOI":"10.1109\/TIT.2016.2584082","volume":"62","author":"SL Fong","year":"2016","unstructured":"Fong, S.L. and Tan, V.Y.F., Strong Converse Theorems for Classes of Multimessage Multicast Networks: A R\u00e9nyi Divergence Approach, IEEE Trans. Inform. Theory, 2016, vol. 62, no. 9, pp. 4953\u20134967.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4346_CR16","doi-asserted-by":"crossref","unstructured":"Polyanskiy, Y. and Verd\u00fa, S., Arimoto Channel Coding Converse and R\u00e9nyi Divergence, in Proc. 48th Annual Allerton Conf. on Communication, Control, and Computation, Sept. 29\u2013Oct. 1, 2010, Allerton, IL, USA, pp. 1327\u20131333.","DOI":"10.1109\/ALLERTON.2010.5707067"},{"issue":"2","key":"4346_CR17","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/TIT.2010.2102110","volume":"57","author":"R K\u00f6tter","year":"2011","unstructured":"K\u00f6tter, R., Effros, M., and Medard, M., A Theory of Network Equivalence\u2014Part I: Point-to-Point Channels, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 2, pp. 972\u2013995.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"4346_CR18","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/TIT.2005.864424","volume":"52","author":"AF Dana","year":"2006","unstructured":"Dana, A.F., Gowaikar, R., Palanki, R., Hassibi, B., and Effros, M., Capacity of Wireless Erasure Networks, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 3, pp. 789\u2013804.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4346_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I Csisz\u00e1r","year":"2011","unstructured":"Csisz\u00e1r, I. and K\u00f6rner, J., Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge, UK: Cambridge Univ. Press, 2011, 2nd ed. First edition translated under the title Teoriya informatsii: teoremy kodirovaniya dlya diskretnykh sistem bez pamyati, Moscow: Mir, 1985.","edition":"2nd ed"},{"issue":"7","key":"4346_CR20","doi-asserted-by":"publisher","first-page":"4183","DOI":"10.1109\/TIT.2017.2690994","volume":"63","author":"SL Fong","year":"2017","unstructured":"Fong, S.L. and Tan, V.Y.F., Achievable Rates for Gaussian Degraded Relay Channels with Non-vanishing Error Probabilities, IEEE Trans. Inform. Theory, 2017, vol. 63, no. 7, pp. 4183\u20134201.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"4346_CR21","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1109\/TIT.2017.2648822","volume":"63","author":"LV Truong","year":"2017","unstructured":"Truong, L.V., Fong, S.L., and Tan, V.Y.F., On Gaussian Channels with Feedback under Expected Power Constraints and with Non-vanishing Error Probabilities, IEEE Trans. Inform. Theory, 2017, vol. 63, no. 3, pp. 1746\u20131765.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4346_CR22","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TIT.1982.1056444","volume":"28","author":"I Csisz\u00e1r","year":"1982","unstructured":"Csisz\u00e1r, I. and K\u00f6rner, J., Feedback Does Not Affect the Reliability Function of a DMC at Rates above Capacity, IEEE Trans. Inform. Theory, 1982, vol. 28, no. 1, pp. 92\u201393.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"4346_CR23","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/TIT.1984.1056935","volume":"30","author":"LH Ozarow","year":"1984","unstructured":"Ozarow, L.H., The Capacity of the White Gaussian Multiple Access Channel with Feedback, IEEE Trans. Inform. Theory, 1984, vol. 30, no. 4, pp. 623\u2013629.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4346_CR24","unstructured":"Massey, J.L., Causality, Feedback and Directed Information, in Proc. 1990 IEEE Int. Sympos. on Information Theory and Its Applications (ISITA\u201990), Waikiki, Hawaii, Nov. 27\u201330, 1990, pp. 303\u2013305."},{"issue":"3","key":"4346_CR25","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TIT.1986.1057176","volume":"32","author":"K Marton","year":"1986","unstructured":"Marton, K., A Simple Proof of the Blowing-Up Lemma, IEEE Trans. Inform. Theory, 1986, vol. 32, no. 3, pp. 445\u2013446.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4346_CR26","doi-asserted-by":"crossref","unstructured":"Liu, J., van Hendel, R., and Verdu, S., Beyond the Blowing-Up Lemma: Sharp Converses via Reverse Hypercontractivity, in Proc. 2017 IEEE Int. Sympos. on Information Theory (ISIT\u20192017), Aachen, Germany, June 25\u201330, 2017, pp. 943\u2013947.","DOI":"10.1109\/ISIT.2017.8006667"},{"key":"4346_CR27","doi-asserted-by":"crossref","unstructured":"Oohama, Y., Strong Converse Exponent for Degraded Broadcast Channels at Rates Outside the Capacity Region, in Proc. 2015 IEEE Int. Sympos. on Information Theory (ISIT\u20192015), Hong Kong, China, June 14\u201319, 2015, pp. 939\u2013943.","DOI":"10.1109\/ISIT.2015.7282593"},{"key":"4346_CR28","unstructured":"Oohama, Y., Exponent Function for Asymmetric Broadcast Channels at Rates Outside the Capacity Region, in Proc. 2016 IEE Int. Sympos. on Information Theory and Its Applications (ISITA\u20192016), Monterey, CA, USA, Oct. 30\u2013Nov. 2, 2016, pp. 537\u2013541."},{"issue":"4","key":"4346_CR29","doi-asserted-by":"publisher","first-page":"1550","DOI":"10.1109\/TIT.2015.2400999","volume":"61","author":"VYF Tan","year":"2015","unstructured":"Tan, V.Y.F., On the Reliability Function of the Discrete Memoryless Relay Channel, IEEE Trans. Inform. Theory, 2015, vol. 61, no. 4, pp. 1550\u20131573.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"4346_CR30","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1109\/18.669158","volume":"44","author":"E Arikan","year":"1998","unstructured":"Arikan, E. and Merhav, N., Guessing Subject to Distortion, IEEE Trans. Inform. Theory, 1998, vol. 44, no. 3, pp. 1041\u20131056.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4346_CR31","unstructured":"Kelly, B.G. and Wagner, A.B., Reliability in Source Coding with Side Information, arXiv:1109.0923 [cs.IT], 2011."},{"key":"4346_CR32","unstructured":"Petersen, K.B. and Pedersen, M.S., The Matrix Cookbook, Technical Univ. of Denmark, 2012. Available at http:\/\/www2.imm.dtu.dk\/pubdb\/p.php?3274."},{"issue":"84","key":"4346_CR33","first-page":"11","volume":"42","author":"IN Sanov","year":"1957","unstructured":"Sanov, I.N., On the Probability of Large Deviations of Random Variables, Mat. Sbornik, 1957, vol. 42(84), no. 1, pp. 11\u201344 [Select. Transl. Math. Statist. Probab. (Engl. Transl.), 1961, vol. 1, pp. 213\u2013244].","journal-title":"Mat. Sbornik"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946019010046.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946019010046","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946019010046.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:35:01Z","timestamp":1775010901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946019010046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["4346"],"URL":"https:\/\/doi.org\/10.1134\/s0032946019010046","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"24 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}