{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:52:18Z","timestamp":1730274738404,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620456","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"1396-1400","source":"Crossref","is-referenced-by-count":3,"title":["Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity"],"prefix":"10.1109","author":[{"given":"Yoshinari","family":"Takeishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masanori","family":"Kawakita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun'ichi","family":"Takeuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","first-page":"41","article-title":"Sparse superposition codes with Bernoulli dictionary","volume":"112","author":"takeishi","year":"2012","journal-title":"Technical report of IEICE"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184847"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513330"},{"journal-title":"Sparse superposition codes are fast and reliable at rates approaching capacity with Gaussian noise","year":"2011","author":"barron","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"10"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054727"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"4","first-page":"275","article-title":"Least squares superposition coding of moderate dictionary size, reliable at rates up to channel capacity","author":"barron","year":"2010","journal-title":"Proc Int Symp Inf Theory Austin Texas"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"journal-title":"An Introduction to Probability Theory and Its Applications","year":"1957","author":"feller","key":"8"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620456.pdf?arnumber=6620456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T23:27:24Z","timestamp":1490225244000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620456\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620456","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}