{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:07:39Z","timestamp":1740100059688,"version":"3.37.3"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100009950","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009950","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,4,11]]},"DOI":"10.1109\/itw46852.2021.9457594","type":"proceedings-article","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T20:31:13Z","timestamp":1624393873000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["On Decoding Fountain Codes with Erroneous Received Symbols"],"prefix":"10.1109","author":[{"given":"Xuan","family":"He","sequence":"first","affiliation":[]},{"given":"Kui","family":"Cai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849687"},{"journal-title":"Error Control Coding","year":"2004","author":"lin","key":"ref11"},{"article-title":"Basis-finding algorithm for decoding fountain codes with erroneous received symbols","year":"2020","author":"he","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref14"},{"key":"ref4","article-title":"Fountain codes under maximum likelihood decoding","author":"l\u00e1zaro","year":"2017","journal-title":"Ph D Dissertation"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3012434"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872855"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1561\/0100000060","article-title":"Raptor codes","volume":"6","author":"shokrollahi","year":"2011","journal-title":"Foundations and Trends? in Communications and Information Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"article-title":"Optimal codes correcting a single indel\/edit for DNA-based data storage","year":"2019","author":"cai","key":"ref9"}],"event":{"name":"2020 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,4,11]]},"location":"Riva del Garda, Italy","end":{"date-parts":[[2021,4,15]]}},"container-title":["2020 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9457568\/9457569\/09457594.pdf?arnumber=9457594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:42:32Z","timestamp":1652197352000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9457594\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,11]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/itw46852.2021.9457594","relation":{},"subject":[],"published":{"date-parts":[[2021,4,11]]}}}