{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:19:46Z","timestamp":1775017186938,"version":"3.50.1"},"reference-count":54,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"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":[[2020,7]]},"DOI":"10.1134\/s0032946020030011","type":"journal-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T12:04:21Z","timestamp":1603109061000},"page":"201-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The Sphere Packing Bound for Memoryless Channels"],"prefix":"10.1134","volume":"56","author":[{"given":"B.","family":"Nakibo\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"5000_CR1","doi-asserted-by":"crossref","unstructured":"Nakibo\u011flu, B., The Augustin Center and the Sphere Packing Bound for Memoryless Channels, in Proc. 2017 IEEE Int. Symp. on Information Theory (ISIT\u20192017), Aachen, Germany, June 25\u201330, 2017, pp.\u00a01401\u20131405.","DOI":"10.1109\/ISIT.2017.8006759"},{"key":"5000_CR2","unstructured":"Elias, P., Coding for Noisy Channels, IRE Conv. Rec., 1955, vol.\u00a04, pp.\u00a037\u201346. Reprinted in Key Papers in the Development of Information Theory, Slepian, D., Ed., New York: IEEE Press, 1974, pp.\u00a0102\u2013111."},{"key":"5000_CR3","unstructured":"Elias, P., Coding for Two Noisy Channels, Information Theory: Third London Symposium (London, England, Sept. 1955), Cherry C., Ed., London: Butterworth Sci., 1956, pp.\u00a061\u201374."},{"key":"5000_CR4","doi-asserted-by":"crossref","unstructured":"Dobrushin, R.L.Asymptotic Estimates of the Probability of Error for Transmission of Messages over a Discrete Memoryless Communication Channel with a Symmetric Transition Probability Matrix, Teor. Veroyatn. Primen., 1962, vol.\u00a07, no.\u00a03, pp.\u00a0283\u2013311 [Theory Probab. Appl. (Engl. Transl.), 1962, vol.\u00a07, no.\u00a03, pp.\u00a0270\u2013300].","DOI":"10.1137\/1107027"},{"key":"5000_CR5","unstructured":"Altu\u011f, Y. and Wagner, A.B., On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels, arXiv:1908.11419[cs.IT], 2019."},{"key":"5000_CR6","doi-asserted-by":"crossref","unstructured":"Altu\u011f, Y. and Wagner, A.B., Refinement of the Sphere Packing Bound for Symmetric Channels, in Proc. 49th Annu. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Sept. 27\u201330, 2011, pp.\u00a030\u201337.","DOI":"10.1109\/Allerton.2011.6120146"},{"issue":"1","key":"5000_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0019-9958(67)90052-6","volume":"10","author":"CE Shannon","year":"1967","unstructured":"Shannon, C.E., Gallager, R.G., and Berlekamp, E.R., Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I, II, Inform. Control, 1967, vol.\u00a010, no.\u00a01, pp.\u00a065\u2013103; no.\u00a05, pp.\u00a0522\u2013552.","journal-title":"Inform. Control"},{"key":"5000_CR8","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":"5000_CR9","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":"4","key":"5000_CR10","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 Memoryless Channel, Probl. Peredachi Inf., 1968, vol.\u00a04, no.\u00a04, pp.\u00a037\u201348 [Probl. Inf. Transm. (Engl. Transl.), 1968, vol.\u00a04, no.\u00a04, pp.\u00a029\u201339].","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"5000_CR11","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/S0019-9958(75)90120-5","volume":"27","author":"JK Omura","year":"1975","unstructured":"Omura, J.K., A Lower Bounding Method for Channel and Source Coding Probabilities, Inform. Control, 1975, vol.\u00a027, no.\u00a02, pp.\u00a0148\u2013177.","journal-title":"Inform. Control"},{"key":"5000_CR12","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\u00a0ed.","edition":"2nd ed"},{"issue":"3","key":"5000_CR13","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1109\/TIT.2014.2299275","volume":"60","author":"Y Altu\u011f","year":"2014","unstructured":"Altu\u011f, Y. and Wagner, A.B., Refinement of the Sphere-Packing Bound: Asymmetric Channels, IEEE Trans. Inform. Theory, 2014, vol.\u00a060, no.\u00a03, pp.\u00a01592\u20131614.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5000_CR14","doi-asserted-by":"crossref","unstructured":"Nakibo\u011flu, B., A Simple Derivation of the Refined SPB for the Constant Composition Codes, in Proc. 2019 IEEE Int. Symp. on Information Theory (ISIT\u20192019), Paris, France, July 7\u201312, 2019, pp.\u00a02659\u20132663.","DOI":"10.1109\/ISIT.2019.8849819"},{"issue":"6","key":"5000_CR15","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1109\/18.21285","volume":"34","author":"AD Wyner","year":"1988","unstructured":"Wyner, A.D., Capacity and Error Exponent for the Direct Detection Photon Channel. II, IEEE Trans. Inform. Theory, 1988, vol.\u00a034, no.\u00a06, pp.\u00a01462\u20131471.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5000_CR16","first-page":"3","volume":"35","author":"MV Burnashev","year":"1999","unstructured":"Burnashev, M.V. and Kutoyants, Yu.A., On the Sphere-Packing Bound, Capacity, and Similar Results for Poisson Channels, Probl. Peredachi Inf., 1999, vol.\u00a035, no.\u00a02, pp.\u00a03\u201322 [Probl. Inf. Transm. (Engl. Transl.), 1999, vol.\u00a035, no.\u00a02, pp.\u00a095\u2013111].","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"5000_CR17","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1002\/j.1538-7305.1959.tb03905.x","volume":"38","author":"CE Shannon","year":"1959","unstructured":"Shannon, C.E., Probability of Error for Optimal Codes in a Gaussian Channel, Bell Syst. Tech. J., 1959, vol.\u00a038, no.\u00a03, pp.\u00a0611\u2013656.","journal-title":"Bell Syst. Tech. J."},{"key":"5000_CR18","unstructured":"Ebert, P.M., Error Bounds for Gaussian Noise Channels, in Quarterly Progress Rep. of the Research Lab. of Electronics, MIT, Cambridge, MA, 1965, no.\u00a077, pp.\u00a0292\u2013302. Available at https:\/\/dspace.mit.edu\/handle\/1721.1\/55609."},{"key":"5000_CR19","unstructured":"Ebert, P.M., Error Bounds for Parallel Communication Channels, Tech. Rep. of the Research Lab. of Electronics, MIT, Cambridge, MA, 1966, no.\u00a0448. Available at https:\/\/dspace.mit.edu\/handle\/1721.1\/4295."},{"key":"5000_CR20","unstructured":"Richters, J.S., Communication over Fading Dispersive Channels, Tech. Rep. of the Research Lab. of Electronics, MIT, Cambridge, MA, 1967, no.\u00a0464. Available at https:\/\/dspace.mit.edu\/handle\/1721.1\/4279."},{"key":"5000_CR21","unstructured":"Lancho Serrano, A., Fundamental Limits of Short-Packet Wireless Communications, PhD Thesis, Departamento de Teor\u00eda de la Se\u00f1al y Comunicaciones, Univ. Carlos III de Madrid, Spain, 2019. Available at https:\/\/e-archivo.uc3m.es\/handle\/10016\/29596."},{"issue":"7","key":"5000_CR22","doi-asserted-by":"publisher","first-page":"4831","DOI":"10.1109\/TWC.2020.2987573","volume":"19","author":"A Lancho","year":"2020","unstructured":"Lancho, A., \u00d6stman, J., Durisi, G., Koch, T., and Vazquez-Vilar, G., Saddlepoint Approximations for Short-Packet Wireless Communications, IEEE Trans. Wireless Commun., 2020, vol.\u00a019, no.\u00a07, pp.\u00a04831\u20134846.","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"1","key":"5000_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF00534118","volume":"14","author":"U Augustin","year":"1969","unstructured":"Augustin, U., Error Estimates for Low Rate Codes, Z. Wahrsch. Verw. Gebiete, 1969, vol.\u00a014, no.\u00a01, pp.\u00a061\u201388.","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"key":"5000_CR24","unstructured":"Augustin, U., Noisy Channels, Habilitation Thesis, Univ. Erlangen-N\u00fcrnberg, Germany, 1978. Avaliable at http:\/\/bit.ly\/2ID8h7m."},{"issue":"2","key":"5000_CR25","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.\u00a065, no.\u00a02, pp.\u00a0816\u2013840.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5000_CR26","first-page":"3","volume":"55","author":"B Nakibo\u011flu","year":"2019","unstructured":"Nakibo\u011flu, B., The Augustin Capacity and Center, Probl. Peredachi Inf., 2019, vol.\u00a055, no.\u00a04, pp.\u00a03\u201351 [Probl. Inf. Transm. (Engl. Transl.), 2019, vol.\u00a055, no.\u00a04, pp.\u00a0299\u2013342].","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"5000_CR27","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.\u00a065, no.\u00a02, pp.\u00a0841\u2013860; see also arXiv:1608.02424[cs.IT] (extended version).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5000_CR28","doi-asserted-by":"publisher","first-page":"919","DOI":"10.3906\/mat-1912-106","volume":"44","author":"B Nakibo\u011flu","year":"2020","unstructured":"Nakibo\u011flu, B., A Simple Derivation of the Refined Sphere Packing Bound under Certain Symmetry Hypotheses, Turkish J. Math., 2020, vol.\u00a044, no.\u00a03, pp.\u00a0919\u2013948.","journal-title":"Turkish J. Math."},{"issue":"1","key":"5000_CR29","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.\u00a011, no.\u00a01, pp.\u00a03\u201318.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"5000_CR30","first-page":"12","volume":"18","author":"GSh Poltyrev","year":"1982","unstructured":"Poltyrev, G.Sh., Random Coding Bounds for Discrete Memoryless Channels, Probl. Peredachi Inf., 1982, vol.\u00a018, no.\u00a01, pp.\u00a012\u201326 [Probl. Inf. Transm. (Engl. Transl.), 1982, vol.\u00a018, no.\u00a01, pp.\u00a09\u201321].","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"5000_CR31","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.\u00a020, no.\u00a04, pp.\u00a0405\u2013417.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5000_CR32","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1109\/TIT.1976.1055576","volume":"22","author":"RE Blahut","year":"1976","unstructured":"Blahut, R.E., Information Bounds of the Fano\u2013Kullback Type, IEEE Trans. Inform. Theory, 1976, vol.\u00a022, no.\u00a04, pp.\u00a0410\u2013421.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5000_CR33","volume-title":"Principles and Practice of Information Theory","author":"RE Blahut","year":"1987","unstructured":"Blahut, R.E., Principles and Practice of Information Theory, Reading, MA: Addison-Wesley, 1987."},{"key":"5000_CR34","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. Symp. on Information Theory (ISIT\u20192015), Hong Kong, China, June 14\u201319, 2015, pp.\u00a0929\u2013933.","DOI":"10.1109\/ISIT.2015.7282591"},{"key":"5000_CR35","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."},{"issue":"7","key":"5000_CR36","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 Harremo\u00ebs, P., R\u00e9nyi Divergence and Kullback\u2013Leibler Divergence, IEEE Trans. Inform. Theory, 2014, vol.\u00a060, no.\u00a07, pp.\u00a03797\u20133820.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5000_CR37","volume-title":"Principles of Mathematical Analysis","author":"W Rudin","year":"1976","unstructured":"Rudin, W., Principles of Mathematical Analysis, New York: McGraw-Hill, 1976, 3rd\u00a0ed.","edition":"3rd ed"},{"key":"5000_CR38","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":"5000_CR39","unstructured":"Elias, P., List Decoding for Noisy Channels, Tech. Rep. of the Research Lab. of Electronics, MIT, Cambridge, MA, 1957, no.\u00a0335. Available at https:\/\/dspace.mit.edu\/handle\/1721.1\/4484."},{"issue":"12","key":"5000_CR40","doi-asserted-by":"publisher","first-page":"8027","DOI":"10.1109\/TIT.2013.2283794","volume":"59","author":"M Dalai","year":"2013","unstructured":"Dalai, M., Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels, IEEE Trans. Inform. Theory, 2013, vol.\u00a059, no.\u00a012, pp.\u00a08027\u20138056.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"5000_CR41","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\u00e9nyi vs. Kullback\u2013Leibler, Entropy, 2017, vol.\u00a019, no.\u00a07, p.\u00a0355 (11\u00a0pp.).","journal-title":"Entropy"},{"issue":"9","key":"5000_CR42","first-page":"5603","volume":"63","author":"M Dalai","year":"2017","unstructured":"Dalai, M. and Winter, A., Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels, IEEE Trans. Inform. Theory, 2017, vol.\u00a063, no.\u00a09, pp.\u00a05603\u20135617.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5000_CR43","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1109\/TIT.2017.2781254","volume":"64","author":"H-C Cheng","year":"2018","unstructured":"Cheng, H.-C. and Hsieh, M.H., Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing, IEEE Trans. Inform. Theory, 2018, vol.\u00a064, no.\u00a02, pp.\u00a01385\u20131403.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"5000_CR44","doi-asserted-by":"publisher","first-page":"2872","DOI":"10.1109\/TIT.2019.2891347","volume":"65","author":"H-C Cheng","year":"2019","unstructured":"Cheng, H.-C., Hsieh, M.H., and Tomamichel, M., Quantum Sphere-Packing Bounds with Polynomial Prefactors, IEEE Trans. Inform. Theory, 2019, vol.\u00a065, no.\u00a05, pp.\u00a02872\u20132898.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"5000_CR45","doi-asserted-by":"publisher","first-page":"6005","DOI":"10.1109\/TIT.2014.2345374","volume":"60","author":"Y Altu\u011f","year":"2014","unstructured":"Altu\u011f, Y. and Wagner, A.B., Refinement of the Random Coding Bound, IEEE Trans. Inform. Theory, 2014, vol.\u00a060, no.\u00a010, pp.\u00a06005\u20136023.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"5000_CR46","doi-asserted-by":"publisher","first-page":"2647","DOI":"10.1109\/TIT.2014.2310453","volume":"60","author":"J Scarlett","year":"2014","unstructured":"Scarlett, J., Martinez, A., and Guill\u00e9n i F\u00e0bregas, A., Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations, IEEE Trans. Inform. Theory, 2014, vol.\u00a060, no.\u00a05, pp.\u00a02647\u20132666.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5000_CR47","doi-asserted-by":"crossref","unstructured":"Honda, J., Exact Asymptotics for the Random Coding Error Probability, in Proc. 2015 IEEE Int. Symp. on Information Theory (ISIT\u20192015), Hong Kong, China, June 14\u201319, 2015, pp.\u00a091\u201395.","DOI":"10.1109\/ISIT.2015.7282423"},{"issue":"2","key":"5000_CR48","first-page":"3","volume":"34","author":"MV Burnashev","year":"1998","unstructured":"Burnashev, M.V. and Holevo, A.S., On the Reliability Function for a Quantum Communication Channel, Probl. Peredachi Inf., 1998, vol.\u00a034, no.\u00a02, pp.\u00a03\u201315 [Probl. Inf. Transm. (Engl. Transl.), 1998, vol.\u00a034, no.\u00a02, pp.\u00a097\u2013107].","journal-title":"Probl. Peredachi Inf."},{"issue":"6","key":"5000_CR49","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1002\/ett.4460100604","volume":"10","author":"E Telatar","year":"1999","unstructured":"Telatar, E., Capacity of Multi-antenna Gaussian Channels, Eur. Trans. Telecommun., 1999, vol.\u00a010, no.\u00a06, pp.\u00a0585\u2013595.","journal-title":"Eur. Trans. Telecommun."},{"issue":"5","key":"5000_CR50","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1109\/TCOMM.2011.030411.100050","volume":"59","author":"M Vu","year":"2011","unstructured":"Vu, M., MISO Capacity with Per-Antenna Power Constraint, IEEE Trans. Commun., 2011, vol.\u00a059, no.\u00a05, pp.\u00a01268\u20131274.","journal-title":"IEEE Trans. Commun."},{"issue":"16","key":"5000_CR51","doi-asserted-by":"publisher","first-page":"4296","DOI":"10.1109\/TSP.2016.2563382","volume":"64","author":"PL Cao","year":"2016","unstructured":"Cao, P.L., Oechtering, T.J., Schaefer, R.F., and Skoglund, M., Optimal Transmit Strategy for MISO Channels with Joint Sum and Per-Antenna Power Constraints, IEEE Trans. Signal Process., 2016, vol.\u00a064, no.\u00a016, pp.\u00a04296\u20134306.","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"5000_CR52","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/TCOMM.2016.2641953","volume":"65","author":"S Loyka","year":"2017","unstructured":"Loyka, S., The Capacity of Gaussian MIMO Channels under Total and Per-Antenna Power Constraints, IEEE Trans. Commun., 2017, vol.\u00a065, no.\u00a03, pp.\u00a01035\u20131043.","journal-title":"IEEE Trans. Commun."},{"key":"5000_CR53","doi-asserted-by":"crossref","unstructured":"Cheng, H.-C. and Nakibo\u011flu, B., Refined Strong Converse for the Constant Composition Codes, in Proc. 2020 IEEE Int. Symp. on Information Theory (ISIT\u20192020), Los Angeles, CA, June 21\u201326, 2020, pp.\u00a02149\u20132154.","DOI":"10.1109\/ISIT44484.2020.9174315"},{"key":"5000_CR54","unstructured":"Yang, W., Fading Channels: Capacity and Channel Coding Rate in the Finite-Blocklength Regime, PhD Thesis, Communication Systems Group, Dept. of Signals and Systems, Chalmers Univ. of Technology, Gothenburg, Sweden, 2015."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020030011.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946020030011","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020030011.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:43:01Z","timestamp":1775011381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946020030011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["5000"],"URL":"https:\/\/doi.org\/10.1134\/s0032946020030011","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"18 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}