{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:07:15Z","timestamp":1730196435650,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/allerton.2014.7028520","type":"proceedings-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T19:24:07Z","timestamp":1423164247000},"page":"675-682","source":"Crossref","is-referenced-by-count":11,"title":["Sign-compute-resolve for random access"],"prefix":"10.1109","author":[{"given":"Jasper","family":"Goseling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cedomir","family":"Stefanovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petar","family":"Popovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507938"},{"key":"17","first-page":"1908","article-title":"SICTA: A 0.693 contention tree algorithm using successive interference cancellation","volume":"3","author":"yu","year":"2005","journal-title":"IEEE INFOCOM"},{"key":"18","article-title":"Coded splitting tree protocols","author":"s\ufffdrensen","year":"2013","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284235"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.100913.130232"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962871"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.101712.121073"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.348337"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.120710.100054"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2011.5956731"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706939"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6502937"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620644"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1002\/sat.1056"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_7"},{"key":"26","first-page":"26","article-title":"Multiple access adder channel","author":"danyev","year":"2007","journal-title":"Multiple access channels"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.121"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2094170"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2012.05.002"},{"key":"3","article-title":"Coded random access: How coding theory helps to build random access protocols","author":"paolini","year":"0","journal-title":"IEEE Communications Magazine"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9082-x"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1024916.1024920"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2014.6881249"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165816"},{"key":"4","first-page":"3885","article-title":"The anti-packets can increase the achievable throughput of a wireless multi-hop network","volume":"9","author":"popovski","year":"2006","journal-title":"IEEE International Conference on Communications (ICC)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2900-5_4"},{"key":"8","first-page":"103","article-title":"Successive compute-and-forward","author":"nazer","year":"2012","journal-title":"Proc Int Zurich Seminar"}],"event":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2014,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2014,10,3]]}},"container-title":["2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7008053\/7028426\/07028520.pdf?arnumber=7028520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T05:20:28Z","timestamp":1490332828000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7028520\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/allerton.2014.7028520","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}