{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:30:44Z","timestamp":1725485444921},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429111"},{"type":"electronic","value":"9783540456247"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45624-4_35","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"333-342","source":"Crossref","is-referenced-by-count":1,"title":["Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms"],"prefix":"10.1007","author":[{"given":"Tadao","family":"Kasami","sequence":"first","affiliation":[]},{"given":"Hitoshi","family":"Tokushige","sequence":"additional","affiliation":[]},{"given":"Yuichi","family":"Kaji","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"T. Fujiwara, H. Yamamoto, T. Kasami and S. Lin, \u201cA trellis-based recursive maximum likelihood decoding algorithm for linear codes\u201d IEEE Trans. Inform. Theory, vol. 44, pp. 714\u2013729, Mar. 1998.","DOI":"10.1109\/18.661515"},{"key":"35_CR2","unstructured":"Y. Kaji, T. Fujiwara and T. Kasami, \u201cAn efficient call-by-need algorithm for the maximum likelihood decoding of a linear code,\u201d Proc. of ISITA2000, Honolulu, HA, USA, pp. 335\u2013338, Nov., 2000."},{"key":"35_CR3","unstructured":"T. Kasami, H. Tokushige and Y. Kaji, \u201cSearch procedures in top-down recursive maximum likelihood decoding algorithm,\u201d Proc. of SITA2000, Aso, Kumamoto, Japan, pp. 535\u2013538, Oct. 2000."},{"key":"35_CR4","unstructured":"Y. Kaji, H. Tokushige and T. Kasami, \u201cAn improved search algorithm for the adaptive and recursive MLD,\u201d Proc. of 2001 ISIT, Washington, D.C., Jun. 2001."},{"key":"35_CR5","unstructured":"T. Kasami, \u201cOn Recursive Maximum Likelihood Decoding Algorithms for Linear Codes,\u201d Technical Report of IEICE, IT2000-58, pp. 75\u201383, Mar. 2001."},{"key":"35_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5745-6","volume-title":"Trellises and Trellis-based Decoding Algorithms for Linear Block Codes","author":"S. Lin","year":"1998","unstructured":"S. Lin, T. Kasami, T. Fujiwara and M. Fossorier, Trellises and Trellis-based Decoding Algorithms for Linear Block Codes, Kluwer Academic Publishers, Boston, MA, 1998."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"G. D. Forney Jr., \u201cCoset codes II: Binary lattice and related codes,\u201d IEEE Trans. Inform. Theory, vol. 34, pp. 1152\u20131187, Sept. 1988.","DOI":"10.1109\/18.21246"},{"key":"35_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-46796-3_5","volume-title":"Proc. of AAECC-13","author":"T. Kasami","year":"1999","unstructured":"T. Kasami, \u201cOn integer programming problems related to soft-decision iterative decoding algorithms,\u201d Proc. of AAECC-13, Honolulu, Hawaii, USA. Lecture Notes in Computer Science, vol. 1719, pp. 43\u201354, Spring Verlag, Nov. 1999."},{"key":"35_CR9","unstructured":"T. Kasami, H. Tokushige, T. Fujiwara, H. Yamamoto and S. Lin, \u201cA recursive maximum likelihood decoding algorithm for some transitive invariant binary block codes,\u201d IEICE Trans. Fundamentals, vol. E81-A, pp. 1916\u20131924, Sept. 1998."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45624-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T03:26:29Z","timestamp":1550373989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}