{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:43:14Z","timestamp":1778496194790,"version":"3.51.4"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1817241"],"award-info":[{"award-number":["CCF-1817241"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/tit.2020.3047630","type":"journal-article","created":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T20:48:36Z","timestamp":1609188516000},"page":"2115-2140","source":"Crossref","is-referenced-by-count":30,"title":["Random Access Channel Coding in the Finite Blocklength Regime"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5640-515X","authenticated-orcid":false,"given":"Recep Can","family":"Yavas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2406-7440","authenticated-orcid":false,"given":"Victoria","family":"Kostina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3757-0675","authenticated-orcid":false,"given":"Michelle","family":"Effros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-274460-0.50022-9"},{"key":"ref72","author":"abramowitz","year":"1972","journal-title":"Handbook of Mathematical Functions"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3000635"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2318726"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566172"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.532885"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/EEEI.2012.6376904"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01149816"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01104893"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997385"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872974"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2606605"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874894"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1561\/0100000004"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700150"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.2307\/1403865"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2668391"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054514"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875410"},{"key":"ref65","first-page":"83","article-title":"Sulla Determinazione Empirica di una Legge di Distribuzione","volume":"4","author":"kolmogorov","year":"1933","journal-title":"Giornale dell’Istituto Italiano Degli Attuari"},{"key":"ref66","first-page":"179","article-title":"Approximate laws of distribution of random variables from empirical data","author":"smirnov","year":"1944","journal-title":"Uspekhi Matematicheskikh Nauk"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205742"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728174"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176990746"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3005155"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1024916.1024920"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437831"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283583"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706106"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.100913.130232"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2900-5_1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736501"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006940"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492547"},{"key":"ref50","article-title":"Gaussian multiple and random access in the finite blocklength regime","author":"yavas","year":"2020","journal-title":"arXiv 2001 03867"},{"key":"ref51","article-title":"Multiple access channels","author":"liao","year":"1972"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/18.75244"},{"key":"ref58","first-page":"11","article-title":"Maximal error capacity regions are smaller than average error capacity regions for multi-user channels","volume":"7","author":"dueck","year":"1978","journal-title":"Problems Control Inf Theory"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6503004"},{"key":"ref56","article-title":"A second-order converse bound for the multiple-access channel via wringing dependence","author":"kosut","year":"2020","journal-title":"arXiv 2007 15664"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2570243"},{"key":"ref54","first-page":"1","article-title":"An elementary proof of the strong converse theorem for the multiple-access channel","volume":"7","author":"ahlswede","year":"1982","journal-title":"J Combinatorics Inform Syst Sci"},{"key":"ref53","first-page":"187","article-title":"The strong converse to the coding theorem for the multiple–access channel","volume":"6","author":"dueck","year":"1981","journal-title":"J Combinat Inf Syst Sci"},{"key":"ref52","first-page":"1","article-title":"Multi-way communication channels","author":"ahlswede","year":"1971","journal-title":"Proc Int Symp Inf Theory (ISIT)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284677"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284211"},{"key":"ref40","volume":"2","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2291231"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371026"},{"key":"ref14","first-page":"10","article-title":"Data transmission over a discrete channel with feedback: Random transmission time","volume":"12","author":"burnashev","year":"1976","journal-title":"Problems Inf Transmiss"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158476"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023634"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365416"},{"key":"ref19","article-title":"Communication over an unknown channel via common broadcasting","author":"shulman","year":"2003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.59923"},{"key":"ref3","first-page":"26","article-title":"On a coding model for a multiple-access adder channel","volume":"17","author":"d\u2019yachkov","year":"1981","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref5","first-page":"92","article-title":"Restricted asynchronous multiple access","volume":"19","author":"bassalygo","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006985"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173963"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173711"},{"key":"ref46","article-title":"Channel coding: Non-asymptotic fundamental limits","author":"polyanskiy","year":"2010"},{"key":"ref45","author":"polyanskiy","year":"2017","journal-title":"Lecture Notes on Information Theory"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173963"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2411256"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874836"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284676"},{"key":"ref44","volume":"2","author":"feller","year":"1971","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref43","first-page":"3013","article-title":"Gaussian multiple and random access in the finite blocklength regime","author":"yavas","year":"2020","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9380622\/9309262-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9380622\/09309262.pdf?arnumber=9309262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:26Z","timestamp":1652194466000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9309262\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":74,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3047630","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}