{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T00:24:32Z","timestamp":1778804672682,"version":"3.51.4"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00083-x","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T01:51:53Z","timestamp":1044409913000},"page":"1775-1797","source":"Crossref","is-referenced-by-count":15,"title":["On viewing block codes as finite automata"],"prefix":"10.1016","volume":"290","author":[{"given":"Priti","family":"Shankar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitava","family":"Dasgupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaustubh","family":"Deshmukh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.Sundar","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(02)00083-X_BIB1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","article-title":"Optimal decoding of linear codes for minimizing symbol error rate","volume":"20","author":"Bahl","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB2","series-title":"Theory and Practice of Error Control Codes","author":"Blahut","year":"1984"},{"issue":"5","key":"10.1016\/S0304-3975(02)00083-X_BIB3","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1109\/18.771145","article-title":"Minimal tail-biting trellises","volume":"45","author":"Calderbank","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB4","series-title":"Error-Correction Coding for Digital Communication","author":"Clark","year":"1981"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB5","series-title":"Sphere Packings, Lattices and Groups","author":"Conway","year":"1993"},{"issue":"5","key":"10.1016\/S0304-3975(02)00083-X_BIB6","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1109\/18.21246","article-title":"Coset codes II","volume":"36","author":"Forney","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0304-3975(02)00083-X_BIB7","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/18.259635","article-title":"The dynamics of group codes","volume":"39","author":"Forney","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0304-3975(02)00083-X_BIB8","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/18.259636","article-title":"Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes","volume":"39","author":"Han","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB9","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"SSC-4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Solid-State Circuits"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB10","series-title":"Introduction to Automata, Languages, and Computation","author":"Hopcroft","year":"1977"},{"issue":"6","key":"10.1016\/S0304-3975(02)00083-X_BIB11","doi-asserted-by":"crossref","first-page":"1828","DOI":"10.1109\/18.556678","article-title":"The trellis structure of maximal fixed cost codes","volume":"42","author":"Kschischang","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/S0304-3975(02)00083-X_BIB12","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1109\/18.476317","article-title":"On the trellis structure of block codes","volume":"41","author":"Kschischang","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB13","series-title":"An Introduction to Symbolic Dynamics and Coding","author":"Lind","year":"1995"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB14","series-title":"The Theory of Error Correcting Codes","author":"MacWilliams","year":"1981"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB15","unstructured":"J.L. Massey, Foundations and methods of channel encoding, in: Proc. Int. Conf. on Information Theory and Systems, Vol. 65, Berlin, Germany, 1978."},{"key":"10.1016\/S0304-3975(02)00083-X_BIB16","series-title":"The Theory of Information and Coding, Encyclopedia of Mathematics and its Applications","author":"McEliece","year":"1977"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB17","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/18.508834","article-title":"On the BCJR trellis for linear block codes","volume":"42","author":"McEliece","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0304-3975(02)00083-X_BIB18","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1109\/18.21228","article-title":"Minimal trellises for block codes","volume":"34","author":"Muder","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB19","series-title":"LATIN 92","first-page":"401","article-title":"On reversible automata","volume":"Vol. 583","author":"Pin","year":"1992"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB20","first-page":"627","article-title":"Minimal Tail-Biting Trellises for certain cyclic block codes are easy to construct","volume":"Vol. 2076","author":"Shankar","year":"2001"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB21","unstructured":"H. Singh, On tail-biting trellises for linear block codes, M.E. Thesis, Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore-560012, January 2001."},{"key":"10.1016\/S0304-3975(02)00083-X_BIB22","series-title":"Handbook of Coding Theory","article-title":"Trellis structure of codes","author":"Vardy","year":"1998"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB23","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","article-title":"Error bounds for convolutional codes and an asymptotically optimum decoding algorithm","volume":"13","author":"Viterbi","year":"1967","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB24","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1002\/ett.4460060507","article-title":"Codes and iterative decoding on general graphs","volume":"6","author":"Wiberg","year":"1995","journal-title":"Eoro. Trans. Telecommun."},{"key":"10.1016\/S0304-3975(02)00083-X_BIB25","first-page":"171","article-title":"Models for dynamics","volume":"Vol. 2","author":"Willems","year":"1989"},{"key":"10.1016\/S0304-3975(02)00083-X_BIB26","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TIT.1978.1055821","article-title":"Efficient maximum-likelihood decoding of linear block codes using a trellis","volume":"24","author":"Wolf","year":"1978","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200083X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200083X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:20:28Z","timestamp":1556713228000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750200083X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S030439750200083X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00083-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}