{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:14Z","timestamp":1773377054379,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100017637","name":"Simons Institute for the Theory of Computing","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100017637","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195698","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["From Bit to Block: Decoding on Erasure Channels"],"prefix":"10.1109","author":[{"given":"Henry D.","family":"Pfister","sequence":"first","affiliation":[{"name":"Duke University"}]},{"given":"Oscar","family":"Sprumont","sequence":"additional","affiliation":[{"name":"University of Washington"}]},{"given":"Gilles","family":"Z\u00e9mor","sequence":"additional","affiliation":[{"name":"Université de Bordeaux & Institut universitaire de France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref2","article-title":"Concatenated codes","author":"Forney","year":"1966","journal-title":"MIT Press"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2009.2021379"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2015.2462817"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2017.2673829"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2016.7541600"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3286452"},{"key":"ref8","article-title":"Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting","volume":"abs\/2312.04329","author":"Abbe","year":"2023","journal-title":"CoRR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/focs57990.2023.00020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"issue":"5","key":"ref11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1017\/S0963548300004466","article-title":"Discrete isoperimetric inequalities and the probability of a decoding error","volume":"9","author":"Tillich","year":"2000","journal-title":"Comb. Probab. Comput."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.3004749"},{"issue":"2","key":"ref13","first-page":"101","article-title":"Probabilistic characteristics of graphs with large connectivity","volume":"10","author":"Margulis","year":"1974","journal-title":"Problems of Information Transmission"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/bf00537230"},{"key":"ref15","volume-title":"Three tutorial lectures on entropy and counting","author":"Galvin","year":"2014"},{"key":"ref16","volume-title":"From bit to block: Decoding on erasure channels","author":"Pfister","year":"2025"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/s0924-6509(08)x7030-8"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195698.pdf?arnumber=11195698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:21Z","timestamp":1773347421000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195698\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195698","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}