{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:38:31Z","timestamp":1775054311960,"version":"3.50.1"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174315","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"2149-2154","source":"Crossref","is-referenced-by-count":11,"title":["Refined Strong Converse for the Constant Composition Codes"],"prefix":"10.1109","author":[{"given":"Hao-Chung","family":"Cheng","sequence":"first","affiliation":[{"name":"University of Cambridge,Department of Applied Mathematics and Theoretical Physics,Cambridge,U.K.,CB3 0WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bar\u0131\u015f","family":"Nakibo\u011flu","sequence":"additional","affiliation":[{"name":"Middle East Technical University (METU),Department of Electrical and Electronics Engineering,Ankara,Turkey,06800"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"rudin","year":"1976","journal-title":"Principles of Mathematical Analysis"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562410060062"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174315"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1134\/S003294601904001X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3906\/mat-1912-106"},{"key":"ref37","first-page":"1","article-title":"On the Liapunoff limit of error in the theory of probability","volume":"a28","author":"esseen","year":"1942","journal-title":"Arkiv f&#x00F6 r Matematik Astronomi och Fysik"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1941-0003498-3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437503"},{"key":"ref34","first-page":"181","article-title":"On the error exponent for source coding and for testing simple statistical hypotheses","volume":"6","author":"csisz\u00e1r","year":"1971","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707067"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1958.8.171"},{"key":"ref11","article-title":"Strong converse theorems in quantum information theory","volume":"33","author":"nagaoka","year":"2001","journal-title":"Proceedings of the ERATO Conference on Quantum Information Science (EQIS)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.796386"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.070504"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110050"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.080501"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-014-2122-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-014-2212-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-017-2928-4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2615847"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891347"},{"key":"ref4","first-page":"199","article-title":"Medium converse for memoryless channels with arbitrary alphabets","volume":"7","author":"beck","year":"1978","journal-title":"Problems of Control and Information Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2299275"},{"key":"ref3","article-title":"Noisy channels","author":"augustin","year":"1978","journal-title":"Habilitation thesis"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849819"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.335960"},{"key":"ref8","first-page":"5","article-title":"Lower bound for error probability in a discrete memoryless channel with feedback","volume":"18","author":"sheverdyaev","year":"1982","journal-title":"Problems of Information Transmission"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055007"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531808"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2882547"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1215\/ijm\/1255380682"},{"key":"ref20","article-title":"Nonasymptotic classical data compression with quantum side informations","author":"cheng","year":"2018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056003"},{"key":"ref21","article-title":"Duality between source coding with quantum side information and c-q channel coding","author":"cheng","year":"2018"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34514-5"},{"key":"ref24","article-title":"Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions","author":"mosonyi","year":"2018"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.2996\/kmj\/1138038812"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006689"},{"key":"ref26","first-page":"30","article-title":"Refinement of the sphere packing bound for symmetric channels","author":"altu?","year":"2011","journal-title":"49th Annual Allerton Conference on Communication Control and Computing"},{"key":"ref43","article-title":"On exact asymptotics of the error probability in channel coding: symmetric channels","author":"altu?","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90120-5"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174315.pdf?arnumber=9174315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:18Z","timestamp":1773347658000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174315\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174315","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}