{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:51:49Z","timestamp":1773377509291,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849785","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2609-2613","source":"Crossref","is-referenced-by-count":2,"title":["LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel"],"prefix":"10.1109","author":[{"given":"Alexios","family":"Balatsoukas-Stimming","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}]},{"given":"Stefano","family":"Rini","sequence":"additional","affiliation":[{"name":"NCTU, Taiwan"}]},{"given":"J\u00f6rg","family":"Kliewer","sequence":"additional","affiliation":[{"name":"NJIT, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055718"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1109\/18.910580","article-title":"Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation","volume":"47","author":"chung","year":"2001","journal-title":"IEEE Trans Inf Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2833855"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034088"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2004.1311469"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335656"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120387"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278023"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006985"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1155\/2007\/74890"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023606"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2018.8625311"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849785.pdf?arnumber=8849785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:09Z","timestamp":1773347649000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849785\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849785","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}