{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:56Z","timestamp":1725488516581},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_4","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"53-64","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Many Faces of Block Codes"],"prefix":"10.1007","author":[{"given":"Kaustubh","family":"Deshmukh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priti","family":"Shankar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitava","family":"Dasgupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Sundar","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"issue":"2","key":"4_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\n                        20(2), March 1974, pp 284\u2013287.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4_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\n                        45(5) July 1999, pp 1435\u20131455.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/18.21246","volume":"36","author":"G.D. Forney Jr.","year":"1988","unstructured":"G.D. Forney, Jr., Coset codes II: Binary lattices and related codes, IEEE Trans. Inform. Theory\n                        36(5), Sept. 1988, pp 1152\u20131187.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4_CR4","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\n                        39(5) Sept 1993, pp 1491\u20131513.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/18.259636","volume":"39","author":"Y.S. Han","year":"1993","unstructured":"Y.S. Han, C.R.P. Hartmann, and C.C. Chen, Efficient Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes, IEEE Trans. Inform. Theory\n                        39(5), Sept. 1993, pp 714\u2013729.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR6","first-page":"100","volume":"SSC-4","author":"P.E. Hart","year":"1968","unstructured":"P.E. Hart, N.J. Nilsson, and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Solid-State Circuits\n                        SSC-4, 1968, pp 100\u2013107.","journal-title":"IEEE Trans. Solid-State Circuits"},{"issue":"6","key":"4_CR7","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\n                        41(6), Nov 1995, pp 1924\u20131937.","journal-title":"IEEE Trans. Inform Theory"},{"issue":"6","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1109\/18.556678","volume":"42","author":"F.R. Kschischang","year":"1996","unstructured":"F.R. Kschischang, The trellis structure of maximal fixed cost codes, IEEE Trans. Inform Theory\n                        42(6), Nov. 1996, pp 1828\u20131837.","journal-title":"IEEE Trans. Inform Theory"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"D. Lind and M. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511626302"},{"key":"4_CR10","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":"4_CR11","unstructured":"J.L. Massey, Foundations and methods of channel encoding, in Proc. Int. Conf. on Information Theory and Systems\n                        65(Berlin, Germany) Sept 1978."},{"key":"4_CR12","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\n                        42, 1996, pp 1072\u20131092","journal-title":"IEEE Trans. Inform Theory"},{"issue":"5","key":"4_CR13","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\n                        34(5), Sept 1988, pp 1049\u20131053.","journal-title":"IEEE Trans. Inform Theory"},{"key":"4_CR14","series-title":"Technical Report","volume-title":"On Viewing Block Codes as Finite Automata","author":"A. Dasgupta","year":"1999","unstructured":"Amitava Dasgupta, Priti Shankar, Kaustubh Deshmukh, and B.S. Rajan, On Viewing Block Codes as Finite Automata, Technical Report IISc-CSA-1999-7, Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India, November, 1999."},{"key":"4_CR15","unstructured":"A. Vardy, Trellis structure of codes, in Handbook of Coding Theory, R.A. Brualdi, W.C. Huffman, V.S. Pless, Eds., Vol.2, Chap. 24, Elsevier, 1998."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","volume":"13","author":"A.J. Viterbi","year":"1967","unstructured":"A.J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inform Theory\n                        13, April 1967, pp 260\u2013269.","journal-title":"IEEE Trans. Inform Theory"},{"key":"4_CR17","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, Euro. Trans. Telecommun.,6 pp 513\u2013526, Sept 1995.","journal-title":"Euro. Trans. Telecommun."},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-322-96657-5_5","volume-title":"Dynamics Reported","author":"J.C. Willems","year":"1989","unstructured":"J.C. Willems, Models for Dynamics, in Dynamics Reported, 2, U. Kirchgraber and H.O. Walther, Eds. New York: Wiley, 1989, pp 171\u2013269."},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/TIT.1978.1055821","volume":"24","author":"J.K. Wolf","year":"1978","unstructured":"J.K. Wolf, Efficient maximum-likelihood decoding of linear block codes using a trellis, IEEE Trans. Inform Theory\n                        24(1), January 1978, pp 76\u201380.","journal-title":"IEEE Trans. Inform Theory"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:49:55Z","timestamp":1558259395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}