{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:56:54Z","timestamp":1772927814008,"version":"3.50.1"},"reference-count":11,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025tap0004","type":"journal-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T22:07:45Z","timestamp":1755122865000},"page":"406-413","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds on Error Probability for Linear Codes with Mismatched Decoding Using Decision Feedback Scheme"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Toshihiro","family":"NIINOMI","sequence":"first","affiliation":[{"name":"Tokyo City University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"YAGI","sequence":"additional","affiliation":[{"name":"University of Electro-Communications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeichi","family":"HIRASAWA","sequence":"additional","affiliation":[{"name":"Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] G.D. Forney, Jr., \u201cExponetial error bounds for erasure, list, and decision feedback schemes,\u201d IEEE Trans. Inf. Theory, vol.IT-14, no.2, pp.206-220, March 1968. 10.1109\/tit.1968.1054129","DOI":"10.1109\/TIT.1968.1054129"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] N. Weinberger and N. Merhav, \u201cSimplified erasure\/list decoding,\u201d IEEE Trans. Inf. Theory, vol.IT-63, no.7, pp.4218-4239, Oct. 2017. 10.1109\/tit.2017.2689778","DOI":"10.1109\/TIT.2017.2689778"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] A. Somekh-Baruch and N. Merhav, \u201cExact random coding exponents for erasure decoding,\u201d IEEE Trans. Inf. Theory, vol.IT-57, no.10, pp.6444-6454, Oct. 2011. 10.1109\/tit.2011.2165826","DOI":"10.1109\/TIT.2011.2165826"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] T. Niinomi, H. Yagi, and S. Hirasawa, \u201cUpper bounds on the error probability for the ensemble of linear block codes with mismatched decoding,\u201d IEICE Trans. Fundamentals, vol.E105-A, no.3, pp.363-371, March 2022. 10.1587\/transfun.2021tap0001","DOI":"10.1587\/transfun.2021TAP0001"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] E. Hof, I. Sason, and, S. Shamai (Shitz), \u201cPerformance bounds for nonbinary linear block codes over memolyless symmetric channels,\u201d IEEE Trans. Inf. Theory, vol.IT-55, no.3, pp.977-996, March 2009. 10.1109\/tit.2008.2011443","DOI":"10.1109\/TIT.2008.2011443"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] E. Hof, I. Sason, and S. Shamai (Shitz), \u201cPerformance bounds for erasure, list, and decision feedback schemes with linear block codes,\u201d IEEE Trans. Inf. Theory, vol.IT-56, no.8, pp.3754-3778, Aug. 2010. 10.1109\/tit.2010.2050797","DOI":"10.1109\/TIT.2010.2050797"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] T. Niinomi, H. Yagi, and S. Hirasawa, \u201cOn the DS2 bound for Forney\u2019s generalized decoding using non-binary linear block codes,\u201d IEICE Trans. Fundamentals, vol.E101-A, no.8, pp.1223-1234, Aug. 2018. 10.1587\/transfun.e101.a.1223","DOI":"10.1587\/transfun.E101.A.1223"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] T.M. Duman and M. Salehi, \u201cNew performance bounds for turbo codes,\u201d IEEE Trans. Commun., vol.COM-46, no.6, pp.717-723, June 1998. 10.1109\/26.681398","DOI":"10.1109\/26.681398"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] P. Delsarte and P. Piret, \u201cAlgebraic constructions of Shannon codes for regular channels,\u201d IEEE Trans. Inf. Theory, vol.IT-28, no.4, pp.593-599, July 1982. 10.1109\/tit.1982.1056525","DOI":"10.1109\/TIT.1982.1056525"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] N. Shulman and M. Feder, \u201cRandom coding techniques for nonrandom codes,\u201d IEEE Trans. Inf. Theory, vol.IT-45, no.6, pp.2101-2104, Sept. 1999. 10.1109\/18.782147","DOI":"10.1109\/18.782147"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] S. Shamai (Shitz) and I. Sason, \u201cVariations on the Gallager bounds, connections, and applications,\u201d IEEE Trans. Inf. Theory, vol.IT-48, no.12, pp.3029-3051, Dec. 2002. 10.1109\/tit.2002.805064","DOI":"10.1109\/TIT.2002.805064"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025TAP0004\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:11:34Z","timestamp":1772856694000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025TAP0004\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025tap0004","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025TAP0004"}}