{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T19:15:00Z","timestamp":1649445300945},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/tit.2017.2725267","type":"journal-article","created":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T19:42:01Z","timestamp":1499802121000},"page":"1-1","source":"Crossref","is-referenced-by-count":4,"title":["Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network"],"prefix":"10.1109","author":[{"given":"Yaoqing","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soummya","family":"Kar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pulkit","family":"Grover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/18.79921"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2364572"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283075"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332464"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447038"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.41"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-1-4612-0619-4_7","article-title":"Random graphs","volume":"184","author":"bollob\u00e1s","year":"1998","journal-title":"Modern Graph Theory"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-012-9296-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.70785"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557101"},{"key":"ref27","first-page":"1056","article-title":"A tight lower bound for parity in noisy communication networks","author":"dutta","year":"2008","journal-title":"Proc 19th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2293214"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2168902"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36978-3_1"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0065-2458(08)60342-3","article-title":"Communication complexity","volume":"44","author":"kushilevitz","year":"1997","journal-title":"Adv Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2014.2306328"},{"key":"ref24","first-page":"236","article-title":"Computation in noisy radio networks","volume":"98","author":"kushilevitz","year":"1998","journal-title":"Proc 9th Annu ACM-SIAM Symp Discrete Algorithms Soc Ind Appl Math"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2004.1313813"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909156"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620607"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921711"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541796"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"ref56","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref55","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730197"},{"key":"ref52","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173632"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691329"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140517"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2188883"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875229"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165816"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/060654864"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2012.185"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.37"},{"key":"ref18","first-page":"1","article-title":"The worst-case capacity of wireless sensor networks","author":"moscibroda","year":"2007","journal-title":"Proc 6th Int Symp Inf Process Sensor Netw (ISPN)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2256795"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1632656"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095070"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2710059"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205989"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028517"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119930"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032853"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692244"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028518"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2048719"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090911"},{"key":"ref44","first-page":"621","article-title":"Capacity achieving linear codes with random binary sparse generating matrices over the binary symmetric channel","author":"abadi","year":"2012","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874535"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/4667673\/07973164.pdf?arnumber=7973164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:54:13Z","timestamp":1649444053000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7973164\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":58,"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2725267","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}