{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:26:20Z","timestamp":1737523580134,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_52","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"627-638","source":"Crossref","is-referenced-by-count":2,"title":["Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct"],"prefix":"10.1007","author":[{"given":"Priti","family":"Shankar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.N.A.","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harmeet","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.S.","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"2","key":"52_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","volume":"20","author":"L.R. Bahl","year":"1974","unstructured":"L.R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. Inform. Theory 20(2), March 1974, pp 284\u2013287.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"52_CR2","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/18.771145","volume":"45","author":"A.R. Calderbank","year":"1999","unstructured":"A.R. Calderbank, G.David Forney,Jr., and Alexander Vardy, Minimal Tail-Biting Trellises: The Golay Code and More, IEEE Trans. Inform. Theory 45(5) July 1999, pp 1435\u20131455.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"52_CR3","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1109\/18.259635","volume":"39","author":"G.D. Forney Jr.","year":"1993","unstructured":"G.D. Forney, Jr. and M.D. Trott, The dynamics of group codes:State spaces, trellis diagrams and canonical encoders, IEEE Trans. Inform. Theory 39(5) Sept 1993, pp 1491\u20131513.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"52_CR4","series-title":"M.E. Thesis","volume-title":"On Tail-Biting Trellises for Linear Block Codes","author":"H. Singh","year":"2001","unstructured":"Harmeet Singh, On Tail-Biting Trellises for Linear Block Codes, M.E. Thesis, Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, 2001."},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Ralf Kotter and Vardy, A.,Construction of Minimal Tail-Biting Trellises, in Proceedings IEEE Information Theory Workshop (Killarney, Ireland, June 1998), 72\u201374.","DOI":"10.1109\/ITW.1998.706441"},{"issue":"6","key":"52_CR6","doi-asserted-by":"publisher","first-page":"1924","DOI":"10.1109\/18.476317","volume":"41","author":"F.R. Kschischang","year":"1995","unstructured":"F.R. Kschischang and V. Sorokine, On the trellis structure of block codes, IEEE Trans. Inform. Theory 41(6), Nov 1995, pp 1924\u20131937.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"52_CR7","volume-title":"The Theory of Error Correcting Codes","author":"F.J. MacWilliams","year":"1981","unstructured":"F.J. MacWilliams and N.J.A. Sloane,The Theory of Error Correcting Codes, North-Holland, Amsterdam, 1981"},{"key":"52_CR8","unstructured":"J.L. Massey, Foundations and methods of channel encoding, in Proc. Int. Conf. on Information Theory and Systems 65(Berlin, Germany) Sept 1978."},{"key":"52_CR9","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1109\/18.508834","volume":"42","author":"R.J. McEliece","year":"1996","unstructured":"R.J. McEliece, On the BCJR trellis for linear block codes, IEEE Trans. Inform. Theory 42, November 1996, pp 1072\u20131092.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1109\/18.21228","volume":"34","author":"D.J. Muder","year":"1988","unstructured":"D.J. Muder, Minimal trellises for block codes, IEEE Trans. Inform. Theory 34 (5), Sept 1988, pp 1049\u20131053.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"52_CR11","unstructured":"Priti Shankar, P.N.A. Kumar, K. Sasidharan and B.S. Rajan, ML decoding of block codes on their tail-biting trellises, to appear in Proceedings of the 2001 IEEE International Symposium on Information Theory."},{"issue":"4","key":"52_CR12","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/18.850685","volume":"46","author":"Y. Shany","year":"2000","unstructured":"Yaron Shany and Yair Be\u2019ery, Linear Tail-Biting Trellises, the Square-Root Bound, and Applications for Reed-Muller Codes, IEEE Trans. Inform. Theory 46 (4), July 2000, pp 1514\u20131523.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"52_CR13","unstructured":"A. Vardy, Trellis structure of codes, in Handbook of Coding Theory,V.S. Pless and W.C. Huffman, Eds., Elsevier Science, 1998."},{"key":"52_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/ett.4460060507","volume":"6","author":"N. Wiberg","year":"1995","unstructured":"N. Wiberg, H.-A. Loeliger and R. Kotter, Codes and iterative decoding on general graphs, Eoro. Trans. Telecommun.,6, Sept 1995, pp 513\u2013526.","journal-title":"Eoro. Trans. Telecommun."},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"J.K. Wolf, Efficient maximum-likelihood decoding of linear block codes using a trellis, IEEE Trans. Inform. Theory 24, pp 76\u201380.","DOI":"10.1109\/TIT.1978.1055821"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:56Z","timestamp":1737503396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_52","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}