{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:38:33Z","timestamp":1775054313324,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849819","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2659-2663","source":"Crossref","is-referenced-by-count":5,"title":["A Simple Derivation of the Refined SPB for the Constant Composition Codes"],"prefix":"10.1109","author":[{"given":"Bar\u0131\u015f","family":"Nakibo\u011flu","sequence":"first","affiliation":[{"name":"Department of Electrical and Electronics Engineering, Middle East Technical University (METU), Ankara, 06800, Turkey"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2882547"},{"key":"ref11","article-title":"The sphere packing bound for memoryless channels","author":"nakibo?lu","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283794"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2726555"},{"key":"ref14","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2299275"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891347"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705674"},{"key":"ref18","article-title":"A simple derivation of the refined SPB under certain symmetry hypotheses","author":"nakibo?lu","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437503"},{"key":"ref28","author":"rudin","year":"1976","journal-title":"Principles of Mathematical Analysis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref27","article-title":"The Augustin capacity and center","author":"nakibo?lu","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1107027"},{"key":"ref6","first-page":"37","article-title":"Estimates of the error probability exponent for a semicontinuous memoryless channel","volume":"4","author":"haroutunian","year":"1968","journal-title":"Problems of Information Transmission"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"ref8","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00534118"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"key":"ref9","author":"augustin","year":"1978","journal-title":"Noisy channels"},{"key":"ref1","first-page":"61","article-title":"Coding for two noisy channels","author":"elias","year":"1955","journal-title":"Proc Third London Symp Information Theory"},{"key":"ref20","author":"jensen","year":"1995","journal-title":"Saddlepoint Approximations"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562410060062"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref24","first-page":"689","article-title":"Asymptotische abschatzungen in Shannons Informations-theorie","author":"strassen","year":"1962","journal-title":"Trans Third Prague Conf Inf Theory"},{"key":"ref23","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 Scient Math Hungarica"},{"key":"ref26","author":"gnedenko","year":"1954","journal-title":"Limit Distributions for Sums of Independent Random Variables"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392223"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849819.pdf?arnumber=8849819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:14Z","timestamp":1773347654000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849819\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849819","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}