{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:27:42Z","timestamp":1775744862042,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,8,1]]},"DOI":"10.1587\/transfun.2019eal2098","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:13:20Z","timestamp":1596233600000},"page":"995-999","source":"Crossref","is-referenced-by-count":1,"title":["Reduced Complexity Successive-Cancellation Decoding of Polar Codes Based on Linear Approximation"],"prefix":"10.1587","volume":"E103.A","author":[{"given":"Yongli","family":"YAN","sequence":"first","affiliation":[{"name":"Institute of Microelectronics of Chinese Academy of Sciences"},{"name":"University of Chinese Academy of Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuanxuan","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Institute of Microelectronics of Chinese Academy of Sciences"},{"name":"University of Chinese Academy of Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"WU","sequence":"additional","affiliation":[{"name":"Institute of Microelectronics of Chinese Academy of Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] E. Ar\u0131 kan, \u201cChannel polarization: A method for constructing capacity achieving codes for symmetric binary-input memoryless channels,\u201d IEEE Trans. Inf. Theory, vol.55, no.7, pp.3051-3073, July 2009. 10.1109\/tit.2009.2021379","DOI":"10.1109\/TIT.2009.2021379"},{"key":"2","unstructured":"[2] Chairmans notes RAN1#87, Reno, USA, Nov. 2016."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] I. Tal and A. Vardy, \u201cList decoding of polar codes,\u201d IEEE Trans. Inf. Theory, vol.61, no.5, pp.2213-2226, May 2015. 10.1109\/TIT.2015.2410251","DOI":"10.1109\/TIT.2015.2410251"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] K. Niu and K. Chen, \u201cStack decoding of polar codes,\u201d IET Electron. Lett., vol.48, no.12, pp.695-696, June 2012. 10.1049\/el.2012.1459","DOI":"10.1049\/el.2012.1459"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] K. Niu and K. Chen, \u201cCRC-aided decoding of polar codes,\u201d IEEE Commun. Lett., vol.16, no.10, pp.1668-1671, Oct. 2012. 10.1109\/lcomm.2012.090312.121501","DOI":"10.1109\/LCOMM.2012.090312.121501"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] A. Alamdar-Yazdi and F.R. Kschischang, \u201cA simplified successive-cancellation decoder for polar codes,\u201d IEEE Commun. Lett., vol.15, no.12, pp.1378-1380, Dec. 2011. 10.1109\/lcomm.2011.101811.111480","DOI":"10.1109\/LCOMM.2011.101811.111480"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W.J. Gross, \u201cFast polar decoders: Algorithm and implementation,\u201d IEEE J. Sel. Areas Commun., vol.32, no.5, pp.946-957, May 2014. 10.1109\/jsac.2014.140514","DOI":"10.1109\/JSAC.2014.140514"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] R.G. Gallager, \u201cLow-density parity-check codes,\u201d IRE Trans. Inf. Theory, vol.8, no.1, pp.21-28, Jan. 1962. 10.1109\/tit.1962.1057683","DOI":"10.1109\/TIT.1962.1057683"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] N. Hussami, S.B. Korada, and R. Urbanke, \u201cPerformance of polar codes for channel and source coding,\u201d 2009 IEEE International Symposium on Information Theory, pp.1488-1492, July 2009. 10.1109\/isit.2009.5205860","DOI":"10.1109\/ISIT.2009.5205860"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] M.P.C. Fossorier, M. Mihaljevic, and H. Imai, \u201cReduced complexity iterative decoding of low-density parity check codes based on belief propagation,\u201d IEEE Trans. Commun., vol.47, no.5, pp.673-680, May 1999. 10.1109\/26.768759","DOI":"10.1109\/26.768759"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] J. Chen and M.P.C. Fossorier, \u201cNear optimum universal belief propagation based decoding of low-density parity check codes,\u201d IEEE Trans. Commun., vol.50, no.3, pp.406-414, March 2002. 10.1109\/26.990903","DOI":"10.1109\/26.990903"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] J. Chen and M.P.C. Fossorier, \u201cDensity evolution for two improved BP-based decoding algorithms of LDPC codes,\u201d IEEE Commun. Lett., vol.6, no.5, pp.208-210, May 2002. 10.1109\/4234.1001666","DOI":"10.1109\/4234.1001666"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] X.-Y. Hu, E. Eleftheriou, D. Arnold, and A. Dholakia, \u201cEfficient implementations of the sum-product algorithm for decoding LDPC codes,\u201d IEEE Global Telecommunications Conference, vol.2, pp.1036-1036E, Nov. 2001. 10.1109\/glocom.2001.965575","DOI":"10.1109\/GLOCOM.2001.965575"},{"key":"14","unstructured":"[14] Y. Hong, H. Li, and X. Wang, \u201cImproved BP decoding algorithm for polar codes,\u201d J. Xidian University, vol.43, no.4, pp.39-44, Aug. 2016."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] A.A. Hasan and I.D. Marsland, \u201cSC of polar codes based normalized MS algorithm,\u201d 2017 8th IEEE Annual Information Technology, Electronics and Mobile Communication Conference, pp.111-116, Vancouver, The Canada, Oct. 2017. 10.1109\/iemcon.2017.8117164","DOI":"10.1109\/IEMCON.2017.8117164"}],"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\/8\/E103.A_2019EAL2098\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T05:04:28Z","timestamp":1723352668000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/8\/E103.A_2019EAL2098\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,1]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2019eal2098","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,1]]}}}