{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:43:21Z","timestamp":1777434201761,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People\u2019s Republic of China","doi-asserted-by":"publisher","award":["2020YFB1805800"],"award-info":[{"award-number":["2020YFB1805800"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11235-023-00996-5","type":"journal-article","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T04:03:42Z","timestamp":1678680222000},"page":"499-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Puncturing scheme for polar codes based on channel reliability estimation"],"prefix":"10.1007","volume":"82","author":[{"given":"Tianwei","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meiyu","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meiling","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6844-8782","authenticated-orcid":false,"given":"Guijun","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"issue":"7","key":"996_CR1","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan, E. (2009). Channel Polarization: A method for constructing capacity-Achieving codes for symmetric binary-Input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051\u20133073.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"996_CR2","doi-asserted-by":"publisher","first-page":"6253","DOI":"10.1109\/TIT.2010.2080990","volume":"56","author":"SB Korada","year":"2010","unstructured":"Korada, S. B., Sasoglu, E., & Urbanke, R. (2010). Polar codes: Characterization of exponent, bounds, and constructions. IEEE Transactions on Information Theory, 56(12), 6253\u20136264.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"996_CR3","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1109\/LCOMM.2014.2353811","volume":"18","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Liu, A., & Gong, C. (2014). Polar-LDPC concatenated coding for the AWGN wiretap channel. IEEE Communications Letters, 18(10), 1683\u20131686.","journal-title":"IEEE Communications Letters"},{"issue":"3","key":"996_CR4","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/LCOMM.2016.2639482","volume":"21","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Zhang, W., & Liu, Y. (2017). An improved concatenation scheme of Polar codes with Reed-Solomon codes. IEEE Communications Letters, 21(3), 468\u2013471.","journal-title":"IEEE Communications Letters"},{"key":"996_CR5","doi-asserted-by":"crossref","unstructured":"Eslami, A., & Pishro-Nik, H. (2011). A practical approach to polar codes. In: IEEE Proceedings international symposium on information theory (ISIT), vol 20, pp. 16\u201320.","DOI":"10.1109\/ISIT.2011.6033837"},{"issue":"7","key":"996_CR6","doi-asserted-by":"publisher","first-page":"2593","DOI":"10.1109\/TCOMM.2013.052013.120543","volume":"61","author":"DM Shin","year":"2013","unstructured":"Shin, D. M., Lim, S. C., & Yang, K. (2013). Design of length-compatible polar codes based on the reduction of polarizing matrices. IEEE Transactions on Communications, 61(7), 2593\u20132599.","journal-title":"IEEE Transactions on Communications"},{"key":"996_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, L., Zhang, Z., & Wang, X. (2014). On the puncturing patterns for punctured polar codes. In: In: IEEE international symposium on information theory, June 29-July 4, 40(6), 121\u2013125.","DOI":"10.1109\/ISIT.2014.6874807"},{"key":"996_CR8","doi-asserted-by":"crossref","unstructured":"Niu, K., Chen, K., & Lin, J.-R. (2013). Beyond turbo codes: Rate-compatible punctured Polar codes. In: Proceedings (pp. 3423\u20133427). Budapest, Hungary, Jun: IEEE ICC.","DOI":"10.1109\/ICC.2013.6655078"},{"issue":"4","key":"996_CR9","first-page":"1","volume":"18","author":"V Bioglio","year":"2017","unstructured":"Bioglio, V., Gabry, F., & Land, I. (2017). Low-complexity puncturing and shortening of Polar codes. Wireless Communications & Networking Conference Workshops, 18(4), 1\u20137.","journal-title":"Wireless Communications & Networking Conference Workshops"},{"issue":"12","key":"996_CR10","doi-asserted-by":"publisher","first-page":"2081","DOI":"10.1109\/LCOMM.2014.2364845","volume":"18","author":"R Wang","year":"2014","unstructured":"Wang, R., & Liu, R. (2014). A novel puncturing scheme for Polar codes. IEEE Communications Letters, 18(12), 2081\u20132084.","journal-title":"IEEE Communications Letters"},{"issue":"9","key":"996_CR11","doi-asserted-by":"publisher","first-page":"41902","DOI":"10.1109\/ACCESS.2021.3065816","volume":"41","author":"RM Oliveira","year":"2021","unstructured":"Oliveira, R. M., Lamare, D., & Rodrigo, C. (2021). Design of rate-compatible polar codes based on non-uniform channel polarization. IEEE Access, 41(9), 41902\u201341912.","journal-title":"IEEE Access"},{"key":"996_CR12","doi-asserted-by":"crossref","unstructured":"Zhao, J., Zhang, W., & Liu, Y. (2021). A novel puncturing scheme of low rate polar codes based on fixed information set. IEEE Communications Letters, 25(7), 2104\u20132108.","DOI":"10.1109\/LCOMM.2021.3072050"},{"issue":"4","key":"996_CR13","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1109\/LCOMM.2022.3144695","volume":"26","author":"S Han","year":"2022","unstructured":"Han, S., Kim, B., & Ha, J. (2022). Rate-compatible punctured polar codes. IEEE Communications Letters, 26(4), 753\u2013757.","journal-title":"IEEE Communications Letters"},{"issue":"1","key":"996_CR14","first-page":"1","volume":"51","author":"J Dai","year":"2016","unstructured":"Dai, J., Niu, K., & Si, Z. (2016). Evaluation and optimization of gaussian approximation for polar codes. Proceedings of the American Society for Information Science & Technology, 51(1), 1\u20132.","journal-title":"Proceedings of the American Society for Information Science & Technology"},{"issue":"7","key":"996_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1109\/LCOMM.2009.090428","volume":"13","author":"R Mori","year":"2009","unstructured":"Mori, R., & Tanaka, T. (2009). Performance of polar codes with the construction using density evolution. IEEE Communications Letters, 13(7), 519\u2013521.","journal-title":"IEEE Communications Letters"},{"issue":"11","key":"996_CR16","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1109\/TCOMM.2012.081512.110872","volume":"60","author":"P Trifonov","year":"2012","unstructured":"Trifonov, P. (2012). Efficient design and decoding of polar codes. IEEE Transactions on Communications, 60(11), 3221\u20133227.","journal-title":"IEEE Transactions on Communications"},{"key":"996_CR17","doi-asserted-by":"crossref","unstructured":"Tal, I., & A. Vardy,. (2013). How to construct polar codes. IEEE Transactions on Information Theory, 59(10), 6562\u20136582.","DOI":"10.1109\/TIT.2013.2272694"},{"issue":"2","key":"996_CR18","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/18.910580","volume":"47","author":"SY Chung","year":"2001","unstructured":"Chung, S. Y., Richardson, T. J., & Urbanke, R. L. (2001). Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. IEEE Transactions on Information Theory, 47(2), 657\u2013670.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-023-00996-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-023-00996-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-023-00996-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:40:39Z","timestamp":1679532039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-023-00996-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,13]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["996"],"URL":"https:\/\/doi.org\/10.1007\/s11235-023-00996-5","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1950901\/v1","asserted-by":"object"}]},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,13]]},"assertion":[{"value":"19 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The codes generated during the current study are available from the corresponding author on reasonable request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}