{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:58Z","timestamp":1773378118700,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1817241"],"award-info":[{"award-number":["1817241"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518171","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1877-1882","source":"Crossref","is-referenced-by-count":0,"title":["Nested LDPC Codes for Random Access Communication"],"prefix":"10.1109","author":[{"given":"Yuxin","family":"Liu","sequence":"first","affiliation":[{"name":"California Institute of Technology,Department of Electrical Engineering,Pasadena,CA,USA,91125"}]},{"given":"Michelle","family":"Effros","sequence":"additional","affiliation":[{"name":"California Institute of Technology,Department of Electrical Engineering,Pasadena,CA,USA,91125"}]}],"member":"263","reference":[{"key":"ref10","first-page":"201","article-title":"Rate-compatible low density parity check codes for capacity-approaching aRQ scheme in packet data communications","author":"li","year":"0","journal-title":"Int Conf on Comm Internet and Info Tech (CIIT)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365075"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577872"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3049061"},{"key":"ref14","first-page":"68221u","article-title":"Wyner-ziv video compression using rateless IDPC codes","volume":"6822","author":"he","year":"0","journal-title":"Visual Commun and Image Process"},{"key":"ref15","first-page":"1","article-title":"Efficient utilization of rateless IDPC codes for satellite broadcasting services","author":"zhang","year":"0","journal-title":"Int Conf Wireless Comm ”& Signal Proc IEEE"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3390\/a12080170"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3018472"},{"key":"ref19","author":"liu","year":"0","journal-title":"Finite-blocklength and error-exponent analysis for LDPC codes in point-to-point and multiple access communication"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref4","first-page":"10","article-title":"Data transmission over a discrete channel with feedback. random transmission time","volume":"12","author":"burnashev","year":"1976","journal-title":"Problems of Information Transmission"},{"key":"ref27","author":"ho","year":"2004","journal-title":"Networking From a Network Coding Perspective"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.100913.130232"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365416"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023634"},{"key":"ref8","first-page":"3013","article-title":"Gaussian multiple and random access in the finite blocklength regime","author":"yavas","year":"0","journal-title":"Proc IEEE Int Symp on Information Theory (ISIT)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158476"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3047630"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437831"},{"key":"ref20","volume":"2","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173963"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365262"},{"key":"ref26","volume":"2","author":"feller","year":"1971","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2011.40"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518171.pdf?arnumber=9518171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:22Z","timestamp":1773347782000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518171\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518171","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}