{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:05:06Z","timestamp":1730196306800,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/allerton.2011.6120330","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T16:40:38Z","timestamp":1325868038000},"page":"1392-1399","source":"Crossref","is-referenced-by-count":3,"title":["Information theory meets circuit design: Why capacity-approaching codes require more chip area and power"],"prefix":"10.1109","author":[{"given":"Pulkit","family":"Grover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Goldsmith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anant","family":"Sahai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Rabaey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","article-title":"VLSI complexity of coding","author":"el gamal","year":"0","journal-title":"The MIT Conference on Advanced Research in VLSI Cambridge MA Jan 1984"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"journal-title":"Information Theory and Reliable Communication","year":"1971","author":"gallager","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88071-0.50021-7"},{"journal-title":"Computational Aspects of VLSI Design","year":"1983","author":"ullman","key":"16"},{"key":"13","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-13331-3_55","article-title":"The VLSI complexity of boolean functions","author":"kramer","year":"1984","journal-title":"Proceedings of the Symposium \"Rekursive Kombinatorik\"on Logic and Machines Decision Problems and Complexity"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/322609.322777"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"journal-title":"A Complexity Theory for VLSI","year":"1980","author":"thompson","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313073"},{"journal-title":"A General Lower Bound on the Decoding Complexity of Message-passing Decoding","year":"2011","author":"sahai","key":"20"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2011.5766234"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2005.136"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205834"},{"key":"26","first-page":"10","article-title":"Data transmission over a discrete channel with feedback, random transmission time","volume":"12","author":"burnashev","year":"1976","journal-title":"Problemy Perdachi Informatsii"},{"journal-title":"Design of LDPC decoders for improved low error rate performance","year":"2009","author":"zhang","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"journal-title":"Modern Coding Theory","year":"2007","author":"richardson","key":"3"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1109\/JSAC.2011.110922","article-title":"Towards a communicationtheoretic understanding of system-level power consumption","author":"grover","year":"2011","journal-title":"Journal of Selected Areas in Communications"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2010.5416639"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2010.2042255"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920216"},{"key":"7","article-title":"The power cost of overdesigning codes","author":"ganesan","year":"2011","journal-title":"SIPS"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2009.2032584"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.971742"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838090"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856942"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb03624.x"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/230514.571645"}],"event":{"name":"2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2011,9,28]]},"location":"Monticello, IL","end":{"date-parts":[[2011,9,30]]}},"container-title":["2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6111659\/6120135\/06120330.pdf?arnumber=6120330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T01:14:11Z","timestamp":1580606051000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6120330\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/allerton.2011.6120330","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}