{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:19:24Z","timestamp":1787012364250,"version":"build-2736575974"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513330","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"315-319","source":"Crossref","is-referenced-by-count":36,"title":["Toward fast reliable communication at rates near capacity with Gaussian noise"],"prefix":"10.1109","author":[{"given":"Andrew R","family":"Barron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antony","family":"Joseph","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016018"},{"key":"ref10","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860430"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032726"},{"key":"ref13","author":"forney","year":"1966","journal-title":"Concatenated Codes"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.720542"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity-Check Codes"},{"key":"ref16","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref17","author":"huang","year":"2008"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348546"},{"key":"ref19","first-page":"679","article-title":"Support recovery in compressed sensiing: an estimation theoretic approach","author":"karbasi","year":"0","journal-title":"IEEE Int Symp Inform Theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000631"},{"key":"ref27","first-page":"364","article-title":"A rate-splitting approach to the Gaussian multiple-access channel capacity","volume":"47","author":"rimoldi","year":"2001","journal-title":"IEEE Trans Inform Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.256500"},{"key":"ref6","author":"barron","year":"0","journal-title":"Fast Reliable Communication at Rates not Far from Capacity with Gaussian Noise"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864420"},{"key":"ref5","article-title":"Least squares superposition coding of moderate dictionary size, reliable at rates up to channel capacity","author":"barron","year":"0","journal-title":"Proc Int Symp Inform Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887497"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1214\/08-AOS653","article-title":"Near-ideal model selection by $\\ell_1$ minimization","author":"candes","year":"2009","journal-title":"Annals of Statistics"},{"key":"ref2","author":"arikan","year":"2008","journal-title":"On the Rate of Channel Polarization"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054727"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.485715"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.910576"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref23","author":"macwilliams","year":"0","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2009.5054681"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","location":"Austin, TX, USA","start":{"date-parts":[[2010,6,13]]},"end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513330.pdf?arnumber=5513330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T14:32:26Z","timestamp":1591799546000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513330\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513330","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}