{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:27:20Z","timestamp":1775017640288,"version":"3.50.1"},"reference-count":38,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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,10]]},"DOI":"10.1134\/s003294601904001x","type":"journal-article","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T03:03:03Z","timestamp":1579834983000},"page":"299-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["The Augustin Capacity and Center"],"prefix":"10.1134","volume":"55","author":[{"given":"B.","family":"Nakibo\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"key":"4361_CR1","doi-asserted-by":"crossref","unstructured":"Nakibo\u011flu, B., The Augustin Center and the Sphere Packing Bound for Memoryless Channels, Proc. 2017 IEEE Int. Sympos. on Information Theory (ISIT\u20192017), Aachen, Germany, June 25\u201330, 2017, pp. 1401\u20131405.","DOI":"10.1109\/ISIT.2017.8006759"},{"issue":"1","key":"4361_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/18.370121","volume":"41","author":"I Csisz\u00e1r","year":"1995","unstructured":"Csisz\u00e1r, I., Generalized Cutoff Rates and R\u00e9nyi\u2019s Information Measures, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 1, pp. 26\u201334.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"4361_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.3390\/e19070355","volume":"19","author":"M Dalai","year":"2017","unstructured":"Dalai, M., Some Remarks on Classical and Classical-Quantum Sphere Packing Bounds: R\u00e1nyi vs. Kullback-Leibler, Entropy, 2017, vol. 19, no. 7, pp. 355 (11 pp.).","journal-title":"Entropy"},{"key":"4361_CR4","unstructured":"Mosonyi, M. and Ogawa, T., Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding with Constant Compositions, arXiv:1811.10599v4 [quant-ph], 2018."},{"key":"4361_CR5","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."},{"key":"4361_CR6","unstructured":"Augustin, U., Noisy Channels, Habilitation Thesis, Universit\u00e4t Erlangen-N\u00fcrnberg, 1978. Avaliable at http:\/\/bit.ly\/2ID8h7m."},{"key":"4361_CR7","doi-asserted-by":"crossref","unstructured":"Nakibo\u011flu, B., The Sphere Packing Bound for Memoryless Channels, arXiv:1804.06372 [cs.IT], 2018.","DOI":"10.1109\/ISIT.2017.8006759"},{"issue":"7","key":"4361_CR8","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T van Erven","year":"2014","unstructured":"van Erven, T. and Harrem\u00f6es, P., R\u00e9nyi Divergence and Kullback-Leibler Divergence, IEEE Trans. Inform. Theory, 2014, vol. 60, no. 7, pp. 3797\u20133820.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4361_CR9","unstructured":"Shayevitz, O., A Note on a Characterization of R\u00e9nyi Measures and Its Relation to Composite Hypothesis Testing, arXiv:1012.4401v2 [cs.IT], 2010."},{"key":"4361_CR10","doi-asserted-by":"crossref","unstructured":"Shayevitz, O., On R\u00e9nyi Measures and Hypothesis Testing, in Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT\u20192010), Austin, Texas, USA, June 13\u201318, 2010, pp. 894\u2013898.","DOI":"10.1109\/ISIT.2011.6034266"},{"key":"4361_CR11","doi-asserted-by":"crossref","unstructured":"Verd\u00fa, S., \u03b1-Mutual Information, in Proc. 2015 Information Theory and Applications Workshop (ITA\u20192015), San Diego, CA, USA, Feb. 1\u20136, 2015, pp. 1\u20136. Available at http:\/\/ita.ucsd.edu\/workshop\/15\/files\/paper\/paper_374.pdf.","DOI":"10.1109\/ITA.2015.7308959"},{"issue":"2","key":"4361_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/1385-7258(74)90000-6","volume":"77","author":"JHB Kemperman","year":"1974","unstructured":"Kemperman, J.H.B., On the Shannon Capacity of an Arbitrary Channel, Indag. Math., 1974, vol. 77, no. 2, pp. 101\u2013115.","journal-title":"Indag. Math."},{"issue":"2","key":"4361_CR13","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/TIT.2018.2861002","volume":"65","author":"B Nakibo\u011flu","year":"2019","unstructured":"Nakibo\u011flu, B., The R\u00e9nyi Capacity and Center, IEEE Trans. Inform. Theory, 2019, vol. 65, no. 2, pp. 841\u2013860.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4361_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TIT.1965.1053730","volume":"11","author":"RG Gallager","year":"1965","unstructured":"Gallager, R.G., A Simple Derivation of the Coding Theorem and Some Applications, IEEE Trans. Inform. Theory, 1965, vol. 11, no. 1, pp. 3\u201318.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4361_CR15","volume-title":"Information Theory and Reliable Communication","author":"RG Gallager","year":"1968","unstructured":"Gallager, R.G., Information Theory and Reliable Communication, New York: Wiley, 1968."},{"key":"4361_CR16","unstructured":"Ebert, P.M., Error Bounds For Parallel Communication Channels, Tech. Rep. of Research Lab. of Electronics, MIT, Cambridge, MA, USA, 1966, no. 448. Available at https:\/\/dspace.mit.edu\/handle\/1721.1\/4295."},{"key":"4361_CR17","unstructured":"Richters, J.S., Communication over Fading Dispersive Channels, Tech. Rep. of Research Lab. of Electronics, MIT, Cambridge, MA, USA, 1967, no. 464. Available at https:\/\/dspace.mit.edu\/handle\/1721.1\/4279."},{"issue":"4","key":"4361_CR18","first-page":"37","volume":"4","author":"EA Haroutunian","year":"1968","unstructured":"Haroutunian, E.A., Bounds for the Exponent of the Probability of Error for a Semicontinuous Memory-less Channel, Probl. Peredachi Inf., 1968, vol. 4, no. 4, pp. 37\u201348 [Probl. Inf. Transm. (Engl. Transl.), 1968, vol. 4, no. 4, pp. 29\u201339].","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"4361_CR19","first-page":"12","volume":"18","author":"GS Poltyrev","year":"1982","unstructured":"Poltyrev, G. Sh., Random Coding Bounds for Discrete Memoryless Channels, Probl. Peredachi Inf., 1982, vol. 18, no. 1, pp. 12\u201326 [Probl. Inf. Transm. (Engl. Transl.), 1982, vol. 18, no. 1, pp. 9\u201321].","journal-title":"Probl. Peredachi Inf."},{"key":"4361_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755347","volume-title":"Real Analysis and Probability","author":"RM Dudley","year":"2002","unstructured":"Dudley, R.M., Real Analysis and Probability, Cambridge: Cambridge Univ. Press, 2002."},{"key":"4361_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34514-5","volume-title":"Measure Theory","author":"VI Bogachev","year":"2007","unstructured":"Bogachev, V.I., Measure Theory, Berlin: Springer, 2007."},{"key":"4361_CR22","unstructured":"Nakibo\u011flu, B., The Augustin Capacity and Center, arXiv:1803.07937 [cs.IT], 2018."},{"key":"4361_CR23","doi-asserted-by":"publisher","DOI":"10.1063\/1.3057290","volume-title":"Transmission of Information: A Statistical Theory of Communications","author":"RM Fano","year":"1961","unstructured":"Fano, R.M., Transmission of Information: A Statistical Theory of Communications, New York: M.I.T. Press, 1961."},{"issue":"6","key":"4361_CR24","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TIT.1976.1055640","volume":"22","author":"S Arimoto","year":"1976","unstructured":"Arimoto, S., Computation of Random Coding Exponent Functions, IEEE Trans. Inform. Theory, 1976, vol. 22, no. 6, pp. 665\u2013671.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4361_CR25","doi-asserted-by":"crossref","unstructured":"Oohama, Y., The Optimal Exponent Function for the Additive White Gaussian Noise Channel at Rates above the Capacity, in Proc. 2017 IEEE Int. Sympos. on Information Theory (ISIT\u20192017), Aachen, Germany, June 25\u201330, 2017, pp. 1053\u2013s1057.","DOI":"10.1109\/ISIT.2017.8006689"},{"key":"4361_CR26","unstructured":"Oohama, Y., Exponent Function for Stationary Memoryless Channels with Input Cost at Rates above the Capacity, arXiv:1701.06545v3 [cs.IT], 2017."},{"key":"4361_CR27","doi-asserted-by":"crossref","unstructured":"Vazquez-Vilar, G., Martinez, A., and Guill\u00e9n i F\u00e0bregas, A., A Derivation of the Cost-Constrained Sphere-Packing Exponent, in Proc. 2015 IEEE Int. Sympos. on Information Theory (ISIT\u20192015), Hong Kong, China, June 14\u201319, 2015, pp. 929\u2013933.","DOI":"10.1109\/ISIT.2015.7282591"},{"key":"4361_CR28","unstructured":"R\u00e9nyi, A., On Measures of Entropy and Information, Proc. 4th Berkeley Sympos. on Mathematical Statistics and Probability, Berkely, CA, USA, June 20\u2013July 30, 1960, Neyman, J., Ed., Berkely: Univ. of California Press, 1961, vol. 1: Contributions to the Theory of Statistics, pp. 547\u2013561."},{"issue":"3\u20134","key":"4361_CR29","first-page":"299","volume":"2","author":"I Csisz\u00e1r","year":"1967","unstructured":"Csisz\u00e1r, I., Information-type Measures of Difference of Probability Distributions and Indirect Observations, Studia Sci. Math. Hungar., 1967, vol. 2, no. 3\u20134, pp. 299\u2013318.","journal-title":"Studia Sci. Math. Hungar."},{"issue":"11","key":"4361_CR30","doi-asserted-by":"publisher","first-page":"5377","DOI":"10.1109\/TIT.2010.2068710","volume":"56","author":"GL Gilardoni","year":"2010","unstructured":"Gilardoni, G.L., On Pinsker\u2019s and Vajda\u2019s Type Inequalities for Csiszar\u2019s f-Divergences, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 11, pp. 5377\u20135386.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4361_CR31","volume-title":"Probability","author":"AN Shiryaev","year":"1995","unstructured":"Shiryaev, A.N., Probability, New York: Springer, 1995."},{"key":"4361_CR32","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"},{"key":"4361_CR33","series-title":"Basics of Function Theory and Functional Analysis","volume-title":"Elementy teorii funktsii i funktsional\u2019nogo analiza","author":"AN Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N. and Fomin, S.V., Elementy teorii funktsii i funktsional\u2019nogo analiza (Basics of Function Theory and Functional Analysis), Moscow: Nauka, 1968. Translated under the title Introductory Real Analysis, New York: Dover, 1975."},{"issue":"1\u20134","key":"4361_CR34","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02018661","volume":"2","author":"I Csisz\u00e1r","year":"1972","unstructured":"Csisz\u00e1r, I., A Class of Measures of Informativity of Observation Channels, Period. Math. Hungar., 1972, vol. 2, no. 1\u20134, pp. 191\u2013213.","journal-title":"Period. Math. Hungar."},{"issue":"2","key":"4361_CR35","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00537520","volume":"14","author":"R Sibson","year":"1969","unstructured":"Sibson, R., Information Radius, Z. Wahrsch. Verw. Gebiete, 1969, vol. 14, no. 2, pp. 149\u2013160.","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"issue":"4","key":"4361_CR36","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TIT.1974.1055254","volume":"20","author":"RE Blahut","year":"1974","unstructured":"Blahut, R.E., Hypothesis Testing and Information Theory, IEEE Trans. Inform. Theory, 1974, vol. 20, no. 4, pp. 405\u2013417.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4361_CR37","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1109\/TIT.2015.2409261","volume":"61","author":"V Kostina","year":"2015","unstructured":"Kostina, V. and Verd\u00fa, S., Channels with Cost Constraints: Strong Converse and Dispersion, IEEE Trans. Inform. Theory, 2015, vol. 61, no. 5, pp. 2415\u20132429.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4361_CR38","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1109\/TIT.2018.2882547","volume":"65","author":"B Nakibo\u011flu","year":"2019","unstructured":"Nakibo\u011flu, B., The Sphere Packing Bound via Augustin\u2019s Method, IEEE Trans. Inform. Theory, 2019, vol. 65, no. 2, pp. 816\u2013840.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S003294601904001X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S003294601904001X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S003294601904001X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:47:00Z","timestamp":1775011620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S003294601904001X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["4361"],"URL":"https:\/\/doi.org\/10.1134\/s003294601904001x","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]},"assertion":[{"value":"22 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}