{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T11:53:01Z","timestamp":1768996381488,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFA1004902"],"award-info":[{"award-number":["2022YFA1004902"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071446"],"award-info":[{"award-number":["62071446"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/tcomm.2024.3405336","type":"journal-article","created":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T17:21:09Z","timestamp":1716571269000},"page":"6677-6687","source":"Crossref","is-referenced-by-count":1,"title":["A Class of Rateless Reed-Solomon Codes With Near-Linear Computational Complexities"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3528-5483","authenticated-orcid":false,"given":"Leilei","family":"Yu","sequence":"first","affiliation":[{"name":"Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6309-2876","authenticated-orcid":false,"given":"Sian-Jheng","family":"Lin","sequence":"additional","affiliation":[{"name":"resides in Hong Kong, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3592-1681","authenticated-orcid":false,"given":"Yunghsiang S.","family":"Han","sequence":"additional","affiliation":[{"name":"Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, Shenzhen, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"61","article-title":"Coding for two noisy channels","volume-title":"Proc. Inf. Theory, 3rd London Symp.","author":"Elias"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/90.779192"},{"key":"ref3","volume-title":"The TCP\/IP Guide: A Comprehensive, Illustrated Internet Protocols Reference","author":"Kozierok","year":"2005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57183-3_18"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/HPCS.1997.864033"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.803996"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2910517"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3023074"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2879359"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1674-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571863"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2502952"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/9780470546345"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662909"},{"key":"ref19","volume-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"ref20","volume":"16","author":"MacWilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref21","article-title":"Efficient erasure decoding of Reed\u2013Solomon codes","author":"Didier","year":"2009","journal-title":"arXiv:0901.1886"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2600417"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2608892"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.17487\/rfc6330","volume-title":"RaptorQ forward error correction scheme for object delivery","author":"Luby","year":"2011"},{"key":"ref26","volume-title":"Project Webpage","year":"2023"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90020-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.08.003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/ietcom\/E88-B.2.815"},{"key":"ref32","article-title":"Generalizations of the Karatsuba algorithm for polynomial multiplication","author":"Weimerskirch","year":"2003"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/10756213\/10538323.pdf?arnumber=10538323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:22:13Z","timestamp":1732666933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10538323\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":32,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2024.3405336","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}