{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:02Z","timestamp":1725455882511},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617488"},{"type":"electronic","value":"9783540706472"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0025140","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:43:04Z","timestamp":1132382584000},"page":"111-129","source":"Crossref","is-referenced-by-count":2,"title":["Non-minimal trellises for linear block codes"],"prefix":"10.1007","author":[{"given":"Ryan Chi-Kong","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"10_CR1","unstructured":"G. D. Forney, Jr., \u201cReview of random tree codes.\u201d Nasa Ames Research Center, Appendix A of Final Report on Contract NAS2-3637, NASA CR73176, Dec. 1967."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"G. D. Forney, Jr., \u201cTrellises old and new,\u201d in Communications and Cryptography: Two Sides of One Tapestry (R. E. Blahut, D. J. Costello, Jr., U. Maurer, and T. Mittelholzer, eds.), pp. 115\u2013128, Kluwer Academic Publishers, 1994.","DOI":"10.1007\/978-1-4615-2694-0_13"},{"key":"10_CR3","doi-asserted-by":"crossref","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, \u201cOptimal decoding of linear codes for minimizing symbol error rate,\u201d IEEE Trans. on Inform. Theory, vol. 20, pp. 284\u2013287, Mar. 1974.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TIT.1978.1055821","volume":"IT-24","author":"J. K. Wolf","year":"1978","unstructured":"J. K. Wolf, \u201cEfficient maximum-likelihood decoding of linear block codes using a trellis,\u201d IEEE Trans. on Inform. Theory, vol. IT-24, pp. 76\u201380, 1978.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR5","unstructured":"J. L. Massey, \u201cFoundation and methods of channel encoding,\u201d in Proc. Int. Conf. Inform. Theory and Systems, vol. 65, (Berlin), Sept. 1978."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1109\/18.21246","volume":"34","author":"G. D. Forney Jr.","year":"1988","unstructured":"G. D. Forney, Jr., \u201cCoset codes II: Binary lattices and related codes,\u201d IEEE Trans. on Inform. Theory, vol. 34, pp. 1152\u20131187, Sep. 1988.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1109\/18.21228","volume":"34","author":"D. J. Muder","year":"1988","unstructured":"D. J. Muder, \u201cMinimal trellises for block codes,\u201d IEEE Trans. on Inform. Theory, vol. 34, pp. 1049\u20131053, Sept. 1988.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/18.179366","volume":"39","author":"T. Kasami","year":"1993","unstructured":"T. Kasami, T. Takata, T. Fujiwara, and S. Lin, \u201cOn the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes,\u201d IEEE Trans. on Inform. Theory, vol. 39, pp. 242\u2013245, Jan. 1993.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1109\/18.256515","volume":"39","author":"T. Kasami","year":"1993","unstructured":"T. Kasami, T. Takata, T. Fujiwara, and S. Lin, \u201cOn complexity of trellis structure of linear block codes,\u201d IEEE Trans. on Inform. Theory, vol. 39, pp. 1057\u20131064, May 1993.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR10","doi-asserted-by":"crossref","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, \u201cThe dynamics of group codes: State spaces, trellis diagrams and canonical encoders,\u201d IEEE Trans. on Inform. Theory, vol. 39, pp. 1491\u20131513, Sept. 1993.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1109\/18.476317","volume":"41","author":"F. R. Kschischang","year":"1995","unstructured":"F. R. Kschischang and V. Sorokine, \u201cOn the trellis structure of block codes,\u201d IEEE Trans. on Inform. Theory, vol. 41, pp. 1924\u20131937, Nov. 1995.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-57936-2_44","volume":"793","author":"V. Sorokine","year":"1994","unstructured":"V. Sorokine, F. R. Kschischang, and V. Durand, \u201cTrellis-based decoding of binary linear block codes,\u201d Lecture Notes in Computer Science, vol. 793, pp. 270\u2013286, 1994.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/18.179359","volume":"39","author":"Y. Berger","year":"1993","unstructured":"Y. Berger and Y. Be'ery, \u201cBounds on the trellis size of linear block codes,\u201d IEEE Trans. on Inform. Theory, vol. 39, pp. 203\u2013209, Jan. 1993.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"A. D. Kot and C. Leung, \u201cOn the construction and dimensionality of linear block code trellises,\u201d in Proc. 1993 IEEE Int. Symp. on Inform. Theory, (San Antonio, TX), p. 291, Jan. 17\u201322, 1993.","DOI":"10.1109\/ISIT.1993.748605"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1109\/18.340452","volume":"40","author":"G. D. Forney Jr.","year":"1994","unstructured":"G. D. Forney, Jr., \u201cDimension\/length profiles and trellis complexity of linear block codes,\u201d IEEE Trans. on Inform. Theory, vol. 40, pp. 1741\u20131752, Nov. 1994.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR16","unstructured":"F. R. Kschischang and G. B. Horn, \u201cA heuristic for ordering a linear block code to minimize trellis state complexity,\u201d in Proc. 32nd Annual Allerton Conf. on Communication, Control, and Computing, Allerton Park, Illinois, pp. 75\u201384, Sept. 1994."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"R. J. McEliece, \u201cOn the BCJR trellis for linear block codes,\u201d IEEE Trans. on Inform. Theory, vol. 42, 1996. To appear.","DOI":"10.1109\/18.508834"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/18.370171","volume":"41","author":"A. Lafourcade","year":"1995","unstructured":"A. Lafourcade and A. Vardy, \u201cAsymptotically good codes have infinite trellis complexity,\u201d IEEE Trans. on Inform. Theory, vol. 41, pp. 555\u2013559, March 1995.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"M. Esmaeli, T. A. Gulliver, and N. P. Secord, \u201cTrellis complexity of linear block codes via atomic codewords.\u201d Preprint, 1995.","DOI":"10.1007\/BFb0025141"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"A. Lafourcade and A. Vardy, \u201cOptimal sectionalization of a trellis,\u201d IEEE Trans. on Inform. Theory, vol. 42, 1996.","DOI":"10.1109\/18.490504"},{"key":"10_CR21","unstructured":"H. T. Moorthy, S. Lin, and G. T. Uehara, \u201cGood trellises for IC implementation of Viterbi decoders for linear block codes.\u201d Submitted to IEEE Trans. on Commun., 1995."},{"key":"10_CR22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1986.1057187","volume":"IT-32","author":"J. H. Conway","year":"1986","unstructured":"J. H. Conway and N. J. A. Sloane, \u201cLexicographic codes: Error-correcting codes from Game Theory,\u201d IEEE Trans. on Inform. Theory, vol. IT-32, pp. 337\u2013348, May 1986.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"F. R. Kschischang, \u201cThe trellis structure of maximal fixed-cost codes,\u201d IEEE Trans. on Inform. Theory, vol. 42, 1996. To appear.","DOI":"10.1109\/18.556678"},{"key":"10_CR24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TIT.1986.1057135","volume":"32","author":"J. H. Conway","year":"1986","unstructured":"J. H. Conway and N. J. A. Sloane, \u201cSoft decoding techniques for codes and lattices, including the Golay code and the Leech lattice,\u201d IEEE Trans. on Inform. Theory, vol. 32, pp. 41\u201350, 1986.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR25","first-page":"1411","volume":"E76-A","author":"T. Kasami","year":"1993","unstructured":"T. Kasami, T. Takata, T. Fujiwara, and S. Lin, \u201cOn the structural complexity of the l-section minimal trellis diagram for binary linear block codes,\u201d IEICE Transactions, vol. E76-A, pp. 1411\u20131421, 1993.","journal-title":"IEICE Transactions"},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/18.79928","volume":"37","author":"A. Vardy","year":"1991","unstructured":"A. Vardy and Y. Be'ery, \u201cMore efficient soft decoding of the Golay codes,\u201d IEEE Trans. on Inform. Theory, vol. 37, pp. 667\u2013672, 1991.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"C.-K. Lee, \u201cNonminimal trellises for linear block codes,\u201d Master's thesis, University of Toronto, Department of Electrical and Computer Engineering, June 1996.","DOI":"10.1007\/BFb0025140"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"H. T. Moorthy, S. Lin, and G. T. Uehara, \u201cTrellises with parallel structure for block codes with constraint on maximum state space dimension,\u201d in Proc. 1995 IEEE Int. Symp. Inform. Theory (Whistler, B.C., Canada), p. 127, 1995.","DOI":"10.1109\/ISIT.1995.531331"},{"key":"10_CR29","unstructured":"M. Esmaeili, Graphical Properties of Quasi Cyclic Codes PhD thesis, Ottawa-Carleton Institute of Mathematics and Statistics, 1996."}],"container-title":["Lecture Notes in Computer Science","Information Theory and Applications II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T14:01:06Z","timestamp":1683295266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617488","9783540706472"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/bfb0025140","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}