{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:42Z","timestamp":1740131682676,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["06\/MI\/006"],"award-info":[{"award-number":["06\/MI\/006"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/tit.2015.2401040","type":"journal-article","created":{"date-parts":[[2015,2,6]],"date-time":"2015-02-06T15:14:38Z","timestamp":1423235678000},"page":"2283-2299","source":"Crossref","is-referenced-by-count":3,"title":["On the Algebraic Structure of Linear Tail-Biting Trellises"],"prefix":"10.1109","volume":"61","author":[{"given":"David","family":"Conti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nigel","family":"Boston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.825402"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/18.850685"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1986.1096498"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"2027","DOI":"10.1109\/18.556699","article-title":"Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis","volume":"42","author":"kschischang","year":"1996","journal-title":"IEEE Trans Inf Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.476317"},{"article-title":"Graph-cover decoding and finitelength analysis of message-passing iterative decoding of LDPC codes","year":"2005","author":"koetter","key":"ref30"},{"key":"ref37","first-page":"2043","article-title":"Tail-biting trellises of block codes: Trellis complexity and Viterbi decoding complexity","volume":"e82 a","author":"reuven","year":"1999","journal-title":"IEICE Trans Fundam"},{"article-title":"Unifying views of tail-biting trellises for linear block codes","year":"2005","author":"nori","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.21228"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.508834"},{"article-title":"Decoding error-correcting codes via linear programming","year":"2003","author":"feldman","key":"ref10"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_52"},{"article-title":"Codes on graphs: Fundamentals","year":"2013","author":"forney","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.21246"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094811"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2217312"},{"key":"ref16","first-page":"646","article-title":"Reducing complexity of tail-biting trellises","author":"forney","year":"2012","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","article-title":"On the effective weights of pseudocodewords for codes defined on graphs with cycles","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-1-4613-0165-3_13","article-title":"Iterative decoding of tail-biting trellises and connections with symbolic dynamics","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.259635"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3585-7_19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5121-8_11"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.1998.706441"},{"key":"ref3","article-title":"A multivariate weight enumerator for tail-biting trellis pseudocodewords","author":"boston","year":"2009","journal-title":"Proc Workshop Algebra Combinat Dyn"},{"article-title":"An algebraic development of trellis theory","year":"2012","author":"conti","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815769"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.771145"},{"key":"ref8","first-page":"83","article-title":"Factoring linear trellises","author":"conti","year":"2012","journal-title":"Proc Int Zürich Seminar Commun"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120337"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.971744"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483211"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"year":"2012","author":"gluesing-luerssen","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094850"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2267612"},{"key":"ref42","article-title":"Trellis structure of codes","volume":"2","author":"vardy","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842740"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/0137027"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161572"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-1-4615-0895-3_23","article-title":"On the representation of codes in Forney graphs","author":"koetter","year":"2002","journal-title":"Codes Graphs and Systems"},{"article-title":"Minimality and duality of tail-biting trellises for linear codes","year":"2012","author":"weaver","key":"ref43"},{"article-title":"Iterative decoding and pseudocodewords","year":"1999","author":"horn","key":"ref25"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7088688\/07035060.pdf?arnumber=7035060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:51:22Z","timestamp":1641988282000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7035060\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":43,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2401040","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2015,5]]}}}