{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:53:57Z","timestamp":1730278437160,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"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":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611446","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T21:46:27Z","timestamp":1637703987000},"page":"1-6","source":"Crossref","is-referenced-by-count":4,"title":["A recursive SISO decoding algorithm"],"prefix":"10.1109","author":[{"given":"Liudmila","family":"Karakchieva","sequence":"first","affiliation":[]},{"given":"Peter","family":"Trifonov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"75","article-title":"A heuristic for ordering a linear block code to minimize trellis state complexity","author":"kschischang","year":"1994","journal-title":"Proceedings of 32nd Annual Allerton Conference on Communication Control and Computing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.312184"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.490504"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.661515"},{"key":"ref8","first-page":"2389","article-title":"An efficient MAP decoding algorithm which uses the BCJR and the recursive techniques","volume":"84","author":"shibuya","year":"2001","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"ref7","article-title":"MAP and LogMAP decoding algorithms for linear block codes using a code structure","volume":"e83 a","author":"kaji","year":"2000","journal-title":"IEICE Transactions on Fundamentals"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.737541"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174282"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,10,17]]},"location":"Kanazawa, Japan","end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611446.pdf?arnumber=9611446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:52:05Z","timestamp":1652201525000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611446","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}