{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:35Z","timestamp":1773377075861,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"publisher","award":["2023YFA1009602"],"award-info":[{"award-number":["2023YFA1009602"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195363","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A Method to Reduce the Complexity of Computing the Weight Distribution of Polar Codes"],"prefix":"10.1109","author":[{"given":"Zhichao","family":"Liu","sequence":"first","affiliation":[{"name":"University of Chinese Academy and Sciences,Beijing,China"}]},{"given":"Zhiming","family":"Ma","sequence":"additional","affiliation":[{"name":"CAS,Academy of Mathematics and Systems Science,Beijing,China"}]},{"given":"Guiying","family":"Yan","sequence":"additional","affiliation":[{"name":"CAS,Academy of Mathematics and Systems Science,Beijing,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.090312.121501"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3243191"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054545"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(76)90355-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3397795"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619618"},{"key":"ref11","article-title":"A Method to Reduce the Complexity of Computing the Complete Weight Distribution of Polar Codes","author":"Liu","journal-title":"arXiv"},{"key":"ref12","volume-title":"NR; Multiplexing and channel coding","year":"2019"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195363.pdf?arnumber=11195363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:31Z","timestamp":1773347431000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195363\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195363","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}