{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:52Z","timestamp":1773377572195,"version":"3.50.1"},"reference-count":10,"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.8849722","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2664-2668","source":"Crossref","is-referenced-by-count":1,"title":["Two Contributions to Error Exponents for Asynchronous Multiple Access Channel"],"prefix":"10.1109","author":[{"given":"L\u00f3r\u00e1nt","family":"Farkas","sequence":"first","affiliation":[{"name":"BME Department of Analysis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"K\u00f3i","sequence":"additional","affiliation":[{"name":"BME Department of Analysis"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2784369"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282934"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2331952"},{"key":"ref6","article-title":"Error Exponents for Asynchronous Multiple Access Channels. Controlled asynchronism may outperform synchronism","author":"farkas","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.23919\/ISITA.2018.8664214"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2515720"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402977"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875373"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1593551"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/ISITA.2018.8664385"}],"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\/08849722.pdf?arnumber=8849722","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:26Z","timestamp":1773347666000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849722\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849722","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}