{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:33:40Z","timestamp":1750224820526,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Wireless Commun."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1109\/twc.2021.3071379","type":"journal-article","created":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T00:31:25Z","timestamp":1618360285000},"page":"5957-5968","source":"Crossref","is-referenced-by-count":2,"title":["SIVA: A Low Complexity and Optimum Decoding Algorithm for Tail-Biting Codes"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7329-7293","authenticated-orcid":false,"given":"Mohammad","family":"Karimzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4486-5500","authenticated-orcid":false,"given":"Mai","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2906196"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/VTCFall.2014.6965800"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2523924"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866639"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2790935"},{"article-title":"List Viterbi decoding of tail biting convolutional codes","year":"2013","author":"wang","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.1996.567407"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/26.31187"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2319264"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2955730"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.072181"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895569"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846448"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2360528"},{"journal-title":"Advanced Compiler Design Implementation","year":"1997","author":"muchnick","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1800181"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/VTCFall.2016.7880930"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2914652"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.5121\/ijcnc.2010.2405"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.796408"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2705148"},{"journal-title":"Study on Scenarios and Requirements for Next Generation Access Technologies","year":"2018","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1986.1096498"},{"key":"ref9","first-page":"1","article-title":"On the performance of short tail-biting convolutional codes for ultra-reliable communications","author":"gaudio","year":"2017","journal-title":"Proc 11th Int ITG Conf Sys Commun Coding"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.818084"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013767"},{"journal-title":"5G Study on channel model for frequencies from 0 5 to 100 GHz","year":"2018","key":"ref22"},{"key":"ref21","first-page":"1","article-title":"Optimal CRC design and serial list Viterbi decoding for multi-input convolutional codes","author":"karimzadeh","year":"2020","journal-title":"Proc IEEE Global Commun Conf (GLOBECOM)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"journal-title":"NR Physical layer procedures for data","year":"2018","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1142\/9789812770998_0010"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-201-2"}],"container-title":["IEEE Transactions on Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7693\/9531988\/09403903.pdf?arnumber=9403903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:12Z","timestamp":1652194332000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9403903\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":34,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/twc.2021.3071379","relation":{},"ISSN":["1536-1276","1558-2248"],"issn-type":[{"type":"print","value":"1536-1276"},{"type":"electronic","value":"1558-2248"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}