{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:39Z","timestamp":1773377559801,"version":"3.50.1"},"reference-count":20,"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.8849228","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2604-2608","source":"Crossref","is-referenced-by-count":3,"title":["Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns"],"prefix":"10.1109","author":[{"given":"Christopher","family":"Boyd","sequence":"first","affiliation":[{"name":"Department of Communications and Networking, Aalto University, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roope","family":"Vehkalahti","sequence":"additional","affiliation":[{"name":"Department of Communications and Networking, Aalto University, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olav","family":"Tirkkonen","sequence":"additional","affiliation":[{"name":"Department of Communications and Networking, Aalto University, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antti","family":"Laaksonen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Helsinki, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057020"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref12","article-title":"The Size of Bipartite Graphs with Girth Eight","author":"neuwirth","year":"2001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1201\/9781420049954","author":"colbourn","year":"1996","journal-title":"The CRC Handbook of Combinatorial Designs"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828066"},{"key":"ref17","first-page":"7","article-title":"Bounds on the Length of Disjunctive Codess","volume":"18","author":"dyachkov","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2018.8644207"},{"key":"ref19","article-title":"Constructive methods to solve problems of s-surjectivity, conflict resolution, coding in defective memories","author":"busschbach","year":"1984","journal-title":"Rapport Interne ENST 84 D005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095828"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1024916.1024920"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10776-018-0411-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996564"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2812845"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.120710.100054"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.348337"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844097"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90009-7"}],"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\/08849228.pdf?arnumber=8849228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:23Z","timestamp":1773347663000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849228\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849228","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}