{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:59Z","timestamp":1773376679553,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206448","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1277-1282","source":"Crossref","is-referenced-by-count":3,"title":["Tight Upper Bounds on the Error Probability of Spinal Codes over Fading Channels"],"prefix":"10.1109","author":[{"given":"Xiaomeng","family":"Chen","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen),Shenzhen,China,518055"}]},{"given":"Aimin","family":"Li","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen),Shenzhen,China,518055"}]},{"given":"Shaohua","family":"Wu","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen),Shenzhen,China,518055"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2606626"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/0100000009"},{"key":"ref15","volume":"588","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref20","author":"boole","year":"1847","journal-title":"The Mathematical Analysis of Logic"},{"key":"ref11","author":"schotsch","year":"2014","journal-title":"Rateless coding in the finite length regime"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.072313.131212"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173242"},{"key":"ref2","article-title":"De-randomizing shannon: The design and analysis of a capacity-achieving rateless code","author":"balakrishnan","year":"2012"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070568"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3091719"},{"key":"ref16","article-title":"New Upper Bounds on the Error Probability under ML Decoding for Spinal Codes and the Joint Transmission-Decoding System Design","author":"li","year":"2021"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206448"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2875545"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2935198"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3049061"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056454"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342363"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838091"},{"key":"ref5","article-title":"On Improving data-link performance by increasing the channel alphabet and introducing sequence coding","author":"ungerboeck","year":"1976","journal-title":"IEEE International Symposium on Information Theory"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206448.pdf?arnumber=10206448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:38Z","timestamp":1773347258000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206448\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206448","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}