{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T05:46:35Z","timestamp":1744263995184},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_37","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"353-362","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC"],"prefix":"10.1007","author":[{"given":"Tadashi","family":"Wadayama","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"issue":"1","key":"37_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/18.746773","volume":"IT-45","author":"T. Hashimoto","year":"1999","unstructured":"T. Hashimoto, \u201cComposite scheme LR+Th for decoding with erasures and its effective equivalence to Forney\u2019s rule,\u201d IEEE Trans. Inform. Theory, IT-45, No.1, pp.78\u201393 (1999).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"37_CR2","unstructured":"T. Hashimoto, \u201cOn the erasure\/undetected-error probabilities over BSC,\u201d IEICE Technical Report, IT-2000-40,pp.23\u201327, Tokyo (2000)."},{"key":"37_CR3","unstructured":"F.J. MacWilliams and N.J.A. Sloane, \u201cThe theory of error correcting codes,\u201d North-Holland (1986)."},{"key":"37_CR4","unstructured":"W.W. Peterson and E.J. Weldon,Jr., \u201cError-correcting codes,\u201d2nd ed.,MIT press (1972)."},{"key":"37_CR5","unstructured":"E.R. Berlekamp, \u201cAlgebraic coding theory,\u201d Revised 1984 edition, Aegean Park Press (1984)."},{"key":"37_CR6","unstructured":"H. Imai, \u201cFugou riron (coding theory),\u201d IEICE (1990)."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Y. Desaki, T. Fujiwara and T. Kasami, \u201cThe weight distributions of extended binary primitive BCH codes of length 128,\u201d IEEE Trans. Inform. Theory, vol. IT-43, pp. 1364\u20131371, July (1997).","DOI":"10.1109\/18.605611"},{"issue":"8","key":"37_CR8","first-page":"1230","volume":"E77-A","author":"Y. Desaki","year":"1994","unstructured":"Y. Desaki, T. Fujiwara, and T. Kasami, \u201cA method for computing the weight distribution of a block code by using its trellis diagram,\u201d IEICE Trans. Fundamentals, vol. E77-A, No8, pp. 1230\u20131237 Aug. (1994).","journal-title":"IEICE Trans. Fundamentals"},{"key":"37_CR9","unstructured":"T. Wadayama, K. Wakasugi and M. Kasahara, \u201cA trellis-based algorithm for computing weight distribution of coset leaders for binary linear codes,\u201d in Proceedings of International Symposium on Information Theory and Its Application (ISITA 1998), Mexico City, Mexico, Oct. (1998)."},{"key":"37_CR10","unstructured":"M. Maeda and T. Fujiwara, \u201cAn algorithm for computing weight distribution of coset leaders of binary linear block codes,\u201d in Proceedings of International Symposium on Information Theory (ISIT 2000), Sorrento, Italy, June (2000)."},{"key":"37_CR11","unstructured":"Y. Fujita and T. Wadayama, \u201cAn algorithm for computing complete coset weight distribution of binary linear codes,\u201d in Proceedings of 23th Symposium on Information Theory and Its Applications (SITA 2000), Aso, pp.647\u2013650, Oct. (2000)."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/18.481809","volume":"IT-42","author":"A. Kuznetsov","year":"1996","unstructured":"A. Kuznetsov, Francis Swarts, A.J. Han Vinck and Hendrik C. Ferreira, \u201cOn the undetected error probability of linear block codes on channels with memory,\u201d IEEE Trans. Inform. Theory, vol.IT-42,pp.303\u2013309 (1996).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","volume":"IT-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. Inform. Theory, vol.IT-20,pp.284\u2013287 (1974).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"37_CR14","doi-asserted-by":"publisher","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. Inform. Theory, vol.IT-24, pp.76\u201380 (1978).","journal-title":"IEEE Trans. Inform. Theory"}],"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_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:30:45Z","timestamp":1556469045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}