{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:09:16Z","timestamp":1740100156258,"version":"3.37.3"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100009100","name":"General Project of science and Technology Department of Shaanxi Province","doi-asserted-by":"publisher","award":["2020JM-638"],"award-info":[{"award-number":["2020JM-638"]}],"id":[{"id":"10.13039\/501100009100","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,28]]},"DOI":"10.1109\/iwcmc51323.2021.9498769","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T22:27:05Z","timestamp":1628548025000},"page":"1829-1834","source":"Crossref","is-referenced-by-count":0,"title":["Research on the Optimal Decoding Overhead of LT Codes"],"prefix":"10.1109","author":[{"given":"Shuang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Qingyang","family":"Guan","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Cui","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/ic:20040504"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070568"},{"key":"ref10","first-page":"364","article-title":"Analysis of random processes via And-Or tree evaluation","author":"luby","year":"0","journal-title":"Proc 9th Ann ACM-SIAM Symp Discrete Algorithms"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1109\/JPROC.2007.895188","article-title":"Channel coding: The road to channel capacity","volume":"95","author":"daniel","year":"2007","journal-title":"Proceedings of the IEEE"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872855"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.09.070616"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892814"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/26.747810"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"}],"event":{"name":"2021 International Wireless Communications and Mobile Computing (IWCMC)","start":{"date-parts":[[2021,6,28]]},"location":"Harbin City, China","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 International Wireless Communications and Mobile Computing (IWCMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9497780\/9498576\/09498769.pdf?arnumber=9498769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:48:24Z","timestamp":1652197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9498769\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/iwcmc51323.2021.9498769","relation":{},"subject":[],"published":{"date-parts":[[2021,6,28]]}}}