{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:03:43Z","timestamp":1774991023333,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541484","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1173-1177","source":"Crossref","is-referenced-by-count":29,"title":["Proof of threshold saturation for spatially coupled sparse superposition codes"],"prefix":"10.1109","author":[{"given":"Jean","family":"Barbier","sequence":"first","affiliation":[{"name":"Laboratoire de Th&#x00E9;orie des Communications, Ecole Polytechnique F&#x00E9;d&#x00E9;rale de Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamad","family":"Dia","sequence":"additional","affiliation":[{"name":"Laboratoire de Th&#x00E9;orie des Communications, Ecole Polytechnique F&#x00E9;d&#x00E9;rale de Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Macris","sequence":"additional","affiliation":[{"name":"Laboratoire de Th&#x00E9;orie des Communications, Ecole Polytechnique F&#x00E9;d&#x00E9;rale de Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2012.6325197"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2360692"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352296"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/08\/P08009"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283053"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2438870"},{"key":"ref18","article-title":"Properties of spatial coupling in compressed sensing","volume":"abs11401 6380","author":"caltagirone","year":"2014","journal-title":"CoRR"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"2371","DOI":"10.1109\/TIT.2011.2111010","article-title":"Estimation in gaussiannoise: Properties of the minioum mean-square error","volume":"57","author":"guo","year":"2011","journal-title":"IEEE Tans on Information Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875082"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283048"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2015\/05\/P05013"},{"key":"ref5","article-title":"Capacity-achieving sparse superposition codes via approximate message passing decoding","author":"rush","year":"0","journal-title":"arXiv preprint arXiv 1501 02377 2015"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref7","article-title":"Approximate message-passing decoder and capacity-achieving sparse superposition codes","author":"barbier","year":"2015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2289865"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513330"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref20","article-title":"Statistical physics and approximate message-passing algorithms for sparse linear estimation problems in signal processing and coding theory","author":"barbier","year":"2015","journal-title":"University Paris-Diderot"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184847"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541484.pdf?arnumber=7541484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:57Z","timestamp":1774986777000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541484","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}