{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T01:08:00Z","timestamp":1648516080999},"reference-count":20,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1587\/transfun.2019eap1045","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T22:06:16Z","timestamp":1577829976000},"page":"334-345","source":"Crossref","is-referenced-by-count":1,"title":["Decision Feedback Scheme with Criterion LR+Th for the Ensemble of Linear Block Codes"],"prefix":"10.1587","volume":"E103.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":"crossref","unstructured":"[1] T. Niinomi, H. Yagi, and S. Hirasawa, \u201cDecision feedback scheme with criterion LR+Th for the ensemble of linear block codes,\u201d Proc. 2018 International Symposium on Information Theory and its Applications, pp.261-265, Singapore, Oct. 2018. 10.23919\/isita.2018.8664336","DOI":"10.23919\/ISITA.2018.8664336"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] G.D. Forney, Jr., \u201cExponential 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":"3","doi-asserted-by":"publisher","unstructured":"[3] T. Hashimoto, \u201cComposite scheme LR + Th for decoding with erasures and its effective equivalence to Forney's rule,\u201d IEEE Trans. Inf. Theory, vol.45, no.1, pp.78-93, Jan. 1999. 10.1109\/18.746773","DOI":"10.1109\/18.746773"},{"key":"4","unstructured":"[4] G.D. Forney, Jr., Concatenated Codes, M.I.T., MA, 1966."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] H. Yamamoto and K. Itoh, \u201cViterbi decoding algorithm for convolutional codes with repeat request,\u201d IEEE Trans. Inf. Theory, vol.IT-26, no.5, pp.540-547, Sept. 1980. 10.1109\/tit.1980.1056245","DOI":"10.1109\/TIT.1980.1056245"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[7] R.G. Gallager, \u201cA simple derivation of the coding theorem and some applications,\u201d IEEE Trans. Inf. Theory, vol.IT-11, no.1, pp.3-18, Jan. 1965. 10.1109\/tit.1965.1053730","DOI":"10.1109\/TIT.1965.1053730"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[8] 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":"8","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":"9","doi-asserted-by":"publisher","unstructured":"[10] 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":"10","unstructured":"[11] T. Niinomi, H. Yagi, and S. Hirasawa, \u201cOn derivation of tighter Shulman-Feder bound for Forney's generalized decoding,\u201d IEICE Trans. Fundermentals (Japanese edition), vol.J98-A, no.12, pp.680-690, Dec. 2015."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] T. Niinomi, H. Yagi, and S. Hirasawa, \u201cOn the DS2 bound for Forney's generalized decoding using non-binary linear block codes,\u201d IEICE Trans. Fundermentals, vol.E101-A no.8, pp.1223-1234, Aug. 2018. 10.1587\/transfun.e101.a.1223","DOI":"10.1587\/transfun.E101.A.1223"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[13] 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":"13","doi-asserted-by":"publisher","unstructured":"[14] E. Hof, I. Sason, and S. Shamai (Shitz), \u201cPerformance bounds for nonbinary linear block codes over memoryless 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":"14","doi-asserted-by":"publisher","unstructured":"[15] J. Feldman, M.J. Wainwright, and D.R. Karger, \u201cUsing linear programming to decode binary linear codes,\u201d IEEE Trans. Inf. Theory, vol.51, no.3, pp.954-972, March 2005. 10.1109\/tit.2004.842696","DOI":"10.1109\/TIT.2004.842696"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[16] D. Chase, \u201cA class of algorithms for decoding block codes with channel measurement information,\u201d IEEE Trans. Inf. Theory, vol.IT-18, no.1, pp.170-182, Jan. 1972. 10.1109\/tit.1972.1054746","DOI":"10.1109\/TIT.1972.1054746"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[17] H.T. Moorthy, S. Lin, and T. Kasami, \u201cSoft-decision decoding of binary linear block codes based on an iterative search algorithm,\u201d IEEE Trans. Inf. Theory, vol.IT-43, no.3, pp.1030-1040, May 1997. 10.1109\/18.568717","DOI":"10.1109\/18.568717"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[18] T. Koumoto, T. Takata, T. Kasami, and S. Lin, \u201cA low-weight trellis-based iterative soft-decision decoding alogrithm for binary linear block codes,\u201d IEEE Trans. Inf. Theory, vol.IT-45, no.2, pp.731-741, March 1999. 10.1109\/18.749023","DOI":"10.1109\/18.749023"},{"key":"18","unstructured":"[19] T. Kasami, T. Koumoto, T. Fujiwara, H. Yamamoto, Y. Desaki, and S. Lin, \u201cLow weight subtrellises for binary linear block codes and their applications,\u201d IEICE Trans. Fundermentals, vol.E80-A, no.11, pp.2095-2103, Nov. 1997."},{"key":"19","doi-asserted-by":"publisher","unstructured":"[21] 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"},{"key":"20","unstructured":"[22] A.J. Viterbi and J.K. Omura, Principles of Communication and Coding, McGraw-Hill, NY, 1979."}],"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\/E103.A\/1\/E103.A_2019EAP1045\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T05:25:42Z","timestamp":1578288342000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/1\/E103.A_2019EAP1045\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2019eap1045","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}