{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:49:46Z","timestamp":1764175786416,"version":"build-2065373602"},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,10,1]]},"DOI":"10.1587\/transfun.2024eal2095","type":"journal-article","created":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T18:06:46Z","timestamp":1744567606000},"page":"1418-1422","source":"Crossref","is-referenced-by-count":1,"title":["An Improvement of the Weight Distribution of Polar Codes"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Changwei","family":"TU","sequence":"first","affiliation":[{"name":"Zhejiang Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiliang","family":"HUANG","sequence":"additional","affiliation":[{"name":"Zhejiang Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youyan","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Zhejiang Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] E. Ar\u0131kan, \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","doi-asserted-by":"publisher","unstructured":"[2] 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":"3","doi-asserted-by":"publisher","unstructured":"[3] 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":"4","doi-asserted-by":"publisher","unstructured":"[4] 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":"5","doi-asserted-by":"publisher","unstructured":"[5] Z. Huang, Z. Jiang, S. Zhou, and X. Zhang, \u201cOn the non-approximate successive cancellation decoding of binary polar codes with medium kernels,\u201d IEEE Access, vol.11, pp.87505-87519, 2023. 10.1109\/access.2023.3304329","DOI":"10.1109\/ACCESS.2023.3304329"},{"key":"6","unstructured":"[6] S. Lin and D.J. Costello, Error Control Coding, 2nd ed., pp.395-400, Pearson, Upper Saddle River, NJ, USA, 2004."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] B. Li, H. Shen, and D. Tse, \u201cAn adaptive successive cancellation list decoder for polar codes with cyclic redundancy check,\u201d IEEE Commun. Lett., vol.16, no.12, pp.2044-2047, Dec. 2012. 10.1109\/lcomm.2012.111612.121898","DOI":"10.1109\/LCOMM.2012.111612.121898"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M. Bardet, V. Dragoi, A. Otmani, and J.-P. Tillich, \u201cAlgebraic properties of polar codes from a new polynomial formalism,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.230-234, July 2016. 10.1109\/ISIT.2016.7541295","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] M. Bardet, V. Dragoi, A. Otmani, and J.-P. Tillich, \u201cAlgebraic properties of polar codes from a new polynomial formalism,\u201d arXiv:1601.06215, 2016. 10.1109\/ISIT.2016.7541295","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] M. Rowshan, S.H. Dau, and E. Viterbo, \u201cOn the formation of min-weight codewords of polar\/PAC codes and its applications,\u201d IEEE Trans. Inf. Theory, vol.69, no.12, pp.7627-7649, Dec. 2023. 10.1109\/tit.2023.3319015","DOI":"10.1109\/TIT.2023.3319015"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R. Mori and T. Tanaka, \u201cPerformance and construction of polar codes on symmetric binary-input memoryless channels,\u201d Proc. IEEE Int. Symp. Inf. Theory, pp.1496-1500, June\/July 2009. 10.1109\/ISIT.2009.5205857","DOI":"10.1109\/ISIT.2009.5205857"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] P. Trifonov, \u201cEfficient design and decoding of polar codes,\u201d IEEE Trans. Commun., vol.60, no.11, pp.3221-3227, Nov. 2012. 10.1109\/TCOMM.2012.081512.110872","DOI":"10.1109\/TCOMM.2012.081512.110872"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] C. Sch\u00fcrch, \u201cA partial order for the synthesized channels of a polar code,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, pp.220-224, July 2016. 10.1109\/isit.2016.7541293","DOI":"10.1109\/ISIT.2016.7541293"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Y. Polyanskiy, H.V. Poor, and S. Verdu, \u201cChannel coding rate in the finite blocklength regime,\u201d IEEE Trans. Inf. Theory, vol.56, no.5, pp.2307-2359, May 2010. 10.1109\/tit.2010.2043769","DOI":"10.1109\/TIT.2010.2043769"}],"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\/E108.A\/10\/E108.A_2024EAL2095\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T03:29:23Z","timestamp":1759548563000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/10\/E108.A_2024EAL2095\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"references-count":14,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024eal2095","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"article-number":"2024EAL2095"}}