{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:54:27Z","timestamp":1730274867203,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875355","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"2854-2858","source":"Crossref","is-referenced-by-count":0,"title":["Is “Shannon-capacity of noisy computing” zero?"],"prefix":"10.1109","author":[{"given":"Pulkit","family":"Grover","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284015"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034813"},{"key":"18","article-title":"VLSI complexity of coding","author":"el-gamal","year":"1984","journal-title":"The MIT Conf on Adv Research in VLSI"},{"journal-title":"Information-friction and Its Implications on Minimum Energy Required for Communication","year":"2014","author":"grover","key":"15"},{"journal-title":"Art of Computer Programming Volume 1 Fundamental Algorithms","year":"1997","author":"knuth","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/82.644047"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620679"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557339"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313127"},{"key":"3","first-page":"43","article-title":"Probabilistic logics and the synthesis of reliable organisms from unreliable components","volume":"34","author":"von neumann","year":"1956","journal-title":"Automata Studies"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"1","article-title":"Is shannon-capacity of noisy computing","author":"grover","year":"2014","journal-title":"Zerog"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2145870"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.75261"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.818405"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.796377"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.2628"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0853-3"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb01087.x"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875355.pdf?arnumber=6875355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:23:43Z","timestamp":1602674623000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875355","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}