{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:34Z","timestamp":1773377554817,"version":"3.50.1"},"reference-count":24,"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.9174026","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"3013-3018","source":"Crossref","is-referenced-by-count":1,"title":["Gaussian Multiple and Random Access in the Finite Blocklength Regime"],"prefix":"10.1109","author":[{"given":"Recep Can","family":"Yavas","sequence":"first","affiliation":[{"name":"California Institute of Technology,Dept. of Elec. Eng.,Pasadena,CA,91125"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victoria","family":"Kostina","sequence":"additional","affiliation":[{"name":"California Institute of Technology,Dept. of Elec. Eng.,Pasadena,CA,91125"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michelle","family":"Effros","sequence":"additional","affiliation":[{"name":"California Institute of Technology,Dept. of Elec. Eng.,Pasadena,CA,91125"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"92","article-title":"Restricted asynchronous multiple access","volume":"19","author":"bassalygo","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006985"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007026"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875410"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2668391"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849764"},{"key":"ref17","article-title":"Fundamental limits of many-user MAC with finite payloads and fading","volume":"abs 1901 6732","author":"kowshik","year":"2019","journal-title":"CoRR"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849288"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437831"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2411256"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492547"},{"key":"ref5","article-title":"Channel coding: non-asymptotic fundamental limits","author":"polyanskiy","year":"2010","journal-title":"PhD Dissertation Princeton University"},{"key":"ref8","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":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371026"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.59923"},{"key":"ref20","article-title":"A unified approach to Gaussian channels with finite blocklength","author":"molavianjazi","year":"2014","journal-title":"Ph D Dissertation University of Notre Dame"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849742"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173963"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437831"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2570243"}],"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\/09174026.pdf?arnumber=9174026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:21Z","timestamp":1773347661000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174026\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174026","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}