{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:13:46Z","timestamp":1648822426879},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/tit.2010.2094850","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:15:42Z","timestamp":1295640942000},"page":"738-751","source":"Crossref","is-referenced-by-count":12,"title":["Linear Tail-Biting Trellises: Characteristic Generators and the BCJR-Construction"],"prefix":"10.1109","volume":"57","author":[{"given":"Heide","family":"Gluesing-Luerssen","sequence":"first","affiliation":[]},{"given":"Elizabeth A.","family":"Weaver","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.476317"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/ISIT.2000.866407","article-title":"general structure and construction of tail-biting trellises for linear block codes","author":"lin","year":"2000","journal-title":"Proc IEEE Int Symp Inf Theory 2000"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.508834"},{"key":"ref13","first-page":"380","article-title":"convolutional codes over groups: a pragmatic approach","author":"mittelholzer","year":"1995","journal-title":"Proc 33rd Allerton Conf Commun Contr Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.21228"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881733"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.850685"},{"key":"ref17","first-page":"1989","volume":"2","author":"vardy","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055821"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.21246"},{"key":"ref3","author":"forney jr","year":"2009","journal-title":"Minimal Realizations of Linear Systems The Shortest Basis Approach"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.259635"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3585-7_19"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842740"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.771145"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815769"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5695090\/05695113.pdf?arnumber=5695113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:42Z","timestamp":1633909662000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5695113\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":18,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2094850","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}