{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:09Z","timestamp":1773378069655,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834386","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3097-3102","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Capacity-Achieving Codes for General Repeat Channels"],"prefix":"10.1109","author":[{"given":"Francisco","family":"Pernice","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Ray","family":"Li","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Efficient near-optimal codes for general repeat channels","author":"pernice","year":"2022"},{"key":"ref11","article-title":"Shannon’s theorems for channels with synchronization errors","author":"dobrushin","year":"1967","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055498"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316371"},{"key":"ref15","author":"cover","year":"2006","journal-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876861"},{"key":"ref3","article-title":"Explicit and efficient construction of (nearly) optimal rate codes for binary deletion channel and the poisson repeat channel","author":"rubinstein","year":"2021"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881844"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173977"},{"key":"ref8","article-title":"An overview of capacity results for synchronization channels","author":"cheraghchi","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911291"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517755"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849705"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834386.pdf?arnumber=9834386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:08Z","timestamp":1773347768000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834386\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834386","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}