{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:00:31Z","timestamp":1769281231496,"version":"3.49.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437831","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1261-1265","source":"Crossref","is-referenced-by-count":17,"title":["Random Access Channel Coding in the Finite Blocklength Regime"],"prefix":"10.1109","author":[{"given":"Michelle","family":"Effros","sequence":"first","affiliation":[{"name":"California Institute of Technology, Department of Electrical Engineering, Pasadena, CA, 91125, USA"}]},{"given":"Victoria","family":"Kostina","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Department of Electrical Engineering, Pasadena, CA, 91125, USA"}]},{"given":"Recep Can","family":"Yavas","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Department of Electrical Engineering, Pasadena, CA, 91125, USA"}]}],"member":"263","reference":[{"key":"ref10","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 of Information Transmission"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158476"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023634"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365416"},{"key":"ref14","author":"shulman","year":"2003","journal-title":"Communication over an Unknown Channel via Common Broadcasting"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283583"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706106"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736501"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2900-5_1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284677"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6503004"},{"key":"ref4","first-page":"92","article-title":"Restricted asynchronous multiple access","volume":"19","author":"bassalygo","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref27","article-title":"An elementary proof of the strong converse theorem for the multiple-access channel","volume":"d7","author":"ahlswede","year":"1982","journal-title":"J Combinatorics Information and System Sciences"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.59923"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007026"},{"key":"ref29","first-page":"409","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 of Control and Information Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006985"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173711"},{"key":"ref2","first-page":"26","article-title":"On a coding model for a multiple-access adder channel","volume":"17","author":"d'yachkov","year":"1981","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref9","author":"effros","year":"2018","journal-title":"Random access channel coding in the finite blocklength regime"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1024916.1024920"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284211"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371026"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2291231"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006940"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492547"},{"key":"ref26","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 Comb Inform Syst Sci"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO, USA","start":{"date-parts":[[2018,6,17]]},"end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437831.pdf?arnumber=8437831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:25Z","timestamp":1754502985000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437831\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437831","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}