{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:33:43Z","timestamp":1750224823723,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Discovery Grant from the Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/lcomm.2021.3095895","type":"journal-article","created":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T19:25:35Z","timestamp":1625858735000},"page":"3195-3198","source":"Crossref","is-referenced-by-count":3,"title":["Sequential Decoding of Short Length Binary Codes: Performance Versus Complexity"],"prefix":"10.1109","volume":"25","author":[{"given":"Bo","family":"Lian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4274-1785","authenticated-orcid":false,"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"article-title":"Sequential decoding for reliable communication","year":"1957","author":"wozencraft","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/9781119098799"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1991.188486"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.651071"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.651072"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2590428"},{"key":"ref17","first-page":"605","article-title":"Optimal threshold sequential decoding algorithms for linear block codes","volume":"1","author":"jun","year":"2000","journal-title":"Proc IEEE 51st Veh Technol Conf"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2323237"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437559"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454752"},{"article-title":"Performance and decoding complexity analysis of short binary codes","year":"2019","author":"lian","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2005.1605687"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404676"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205685"},{"key":"ref8","first-page":"1","article-title":"Code design for short blocks: A survey","author":"liva","year":"2016","journal-title":"Proc EuCNC"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.041113.120539"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826367"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1800181"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2000.853572"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3006369"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"article-title":"Code performance as a function of block size","year":"1998","author":"dolinar","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.818084"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3052550"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.090312.121501"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9565157\/09478871.pdf?arnumber=9478871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T21:55:27Z","timestamp":1645480527000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9478871\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":27,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2021.3095895","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}