{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T11:45:28Z","timestamp":1784288728814,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s11432-024-4320-3","type":"journal-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T03:47:59Z","timestamp":1758253679000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tanner-graph-assisted belief propagation decoding for large kernel polar codes: low-complexity design and enhancement method"],"prefix":"10.1007","volume":"68","author":[{"given":"Yangyang","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanghua","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaxi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lixia","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"4320_CR1","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/LCOMM.2016.2607169","volume":"20","author":"T Wang","year":"2016","unstructured":"Wang T, Qu D, Jiang T. Parity-check-concatenated polar codes. IEEE Commun Lett, 2016, 20: 2342\u20132345","journal-title":"IEEE Commun Lett"},{"key":"4320_CR2","doi-asserted-by":"publisher","first-page":"152301","DOI":"10.1007\/s11432-022-3498-8","volume":"66","author":"Y Z Wu","year":"2023","unstructured":"Wu Y Z, Li L, Fan P Z. A fast parallel SC-Fano decoding algorithm for PAC codes. Sci China Inf Sci, 2023, 66: 152301","journal-title":"Sci China Inf Sci"},{"key":"4320_CR3","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1109\/MWC.017.2200586","volume":"31","author":"T Jiang","year":"2024","unstructured":"Jiang T, Liu Y, Xiao L, et al. PCC polar codes for future wireless communications: potential applications and design guidelines. IEEE Wireless Commun, 2024, 31: 414\u2013420","journal-title":"IEEE Wireless Commun"},{"key":"4320_CR4","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan E. Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans Inform Theor, 2009, 55: 3051\u20133073","journal-title":"IEEE Trans Inform Theor"},{"key":"4320_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TCOMM.2024.3420740","volume":"73","author":"A Ashikhmin","year":"2025","unstructured":"Ashikhmin A, Trifonov P. Fast successive cancellation decoding of polar codes with large kernels. IEEE Trans Commun, 2025, 73: 3\u201311","journal-title":"IEEE Trans Commun"},{"key":"4320_CR6","doi-asserted-by":"publisher","first-page":"6253","DOI":"10.1109\/TIT.2010.2080990","volume":"56","author":"S B Korada","year":"2010","unstructured":"Korada S B, Sasoglu E, Urbanke R. Polar codes: characterization of exponent, bounds, and constructions. IEEE Trans Inform Theor, 2010, 56: 6253\u20136264","journal-title":"IEEE Trans Inform Theor"},{"key":"4320_CR7","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TIT.2015.2409257","volume":"61","author":"N Presman","year":"2015","unstructured":"Presman N, Shapira O, Litsyn S, et al. Binary polarization kernels from code decompositions. IEEE Trans Inform Theor, 2015, 61: 2227\u20132239","journal-title":"IEEE Trans Inform Theor"},{"key":"4320_CR8","doi-asserted-by":"publisher","first-page":"2720","DOI":"10.1109\/TIT.2014.2312181","volume":"60","author":"R Mori","year":"2014","unstructured":"Mori R, Tanaka T. Source and channel polarization over finite fields and Reed-Solomon matrices. IEEE Trans Inform Theor, 2014, 60: 2720\u20132736","journal-title":"IEEE Trans Inform Theor"},{"key":"4320_CR9","doi-asserted-by":"publisher","first-page":"5253","DOI":"10.1109\/TIT.2015.2469298","volume":"61","author":"H P Lin","year":"2015","unstructured":"Lin H P, Lin S, Abdel-Ghaffar K A S. Linear and nonlinear binary kernels of polar codes of small dimensions with maximum exponents. IEEE Trans Inform Theor, 2015, 61: 5253\u20135270","journal-title":"IEEE Trans Inform Theor"},{"key":"4320_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.23919\/JCC.2023.03.013","volume":"20","author":"Z Feng","year":"2023","unstructured":"Feng Z, Niu C, Zhang Z, et al. List-serial pipelined hardware architecture for SCL decoding of polar codes. China Commun, 2023, 20: 175\u2013184","journal-title":"China Commun"},{"key":"4320_CR11","unstructured":"Bonik G, Goreinov S, Zamarashkin N. Construction and analysis of polar and concatenated polar codes: practical approach. 2012. ArXiv:1207.4343"},{"key":"4320_CR12","unstructured":"Huang Z, Zhang S, Zhang F, et al. On the successive cancellation decoding of polar codes with arbitrary linear binary kernels. 2017. ArXiv:1701.03264"},{"key":"4320_CR13","doi-asserted-by":"publisher","first-page":"4294","DOI":"10.1109\/TCOMM.2021.3072730","volume":"69","author":"G Trofimiuk","year":"2021","unstructured":"Trofimiuk G, Trifonov P. Window processing of binary polarization kernels. IEEE Trans Commun, 2021, 69: 4294\u20134305","journal-title":"IEEE Trans Commun"},{"key":"4320_CR14","doi-asserted-by":"publisher","first-page":"5039","DOI":"10.1109\/TCOMM.2023.3285773","volume":"71","author":"P Trifonov","year":"2023","unstructured":"Trifonov P, Karakchieva L. Recursive processing algorithm for low complexity decoding of polar codes with large kernels. IEEE Trans Commun, 2023, 71: 5039\u20135050","journal-title":"IEEE Trans Commun"},{"key":"4320_CR15","doi-asserted-by":"publisher","first-page":"87505","DOI":"10.1109\/ACCESS.2023.3304329","volume":"11","author":"Z Huang","year":"2023","unstructured":"Huang Z, Jiang Z, Zhou S, et al. On the non-approximate successive cancellation decoding of binary polar codes with medium kernels. IEEE Access, 2023, 11: 87505\u201387519","journal-title":"IEEE Access"},{"key":"4320_CR16","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/MWC.009.2300210","volume":"31","author":"Y Liu","year":"2024","unstructured":"Liu Y, Xiao L, Liu W, et al. Channel coding for satellite-terrestrial integrated communication: classic applications, key technologies, and challenges. IEEE Wireless Commun, 2024, 31: 348\u2013354","journal-title":"IEEE Wireless Commun"},{"key":"4320_CR17","doi-asserted-by":"publisher","first-page":"132304","DOI":"10.1007\/s11432-021-3497-6","volume":"66","author":"Y Y Hu","year":"2023","unstructured":"Hu Y Y, Pan Z W, Guan Y L. Asynchronous multilevel bit-interleaved polar-coded modulation. Sci China Inf Sci, 2023, 66: 132304","journal-title":"Sci China Inf Sci"},{"key":"4320_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-024-4228-3","volume":"67","author":"Q Pang","year":"2024","unstructured":"Pang Q, Ma Z, Tang X. Unreliability normalization weighted bit-flipping algorithms of LDPC decoding for ReRAM systems. Sci China Inf Sci, 2024, 67: 1\u20132","journal-title":"Sci China Inf Sci"},{"key":"4320_CR19","doi-asserted-by":"publisher","first-page":"029302","DOI":"10.1007\/s11432-018-9422-y","volume":"62","author":"Y R Yu","year":"2019","unstructured":"Yu Y R, Pan Z W, Tan X S, et al. A latency-reduced successive cancellation list decoder for polar codes. Sci China Inf Sci, 2019, 62: 029302","journal-title":"Sci China Inf Sci"},{"key":"4320_CR20","doi-asserted-by":"publisher","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","volume":"59","author":"I Tal","year":"2013","unstructured":"Tal I, Vardy A. How to construct polar codes. IEEE Trans Inform Theor, 2013, 59: 6562\u20136582","journal-title":"IEEE Trans Inform Theor"},{"key":"4320_CR21","doi-asserted-by":"publisher","first-page":"6496","DOI":"10.1109\/TSP.2014.2366712","volume":"62","author":"B Yuan","year":"2014","unstructured":"Yuan B, Parhi K K. Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders. IEEE Trans Signal Process, 2014, 62: 6496\u20136506","journal-title":"IEEE Trans Signal Process"},{"key":"4320_CR22","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1109\/LCOMM.2023.3236366","volume":"27","author":"Y Zhao","year":"2023","unstructured":"Zhao Y, Yin Z, Yang Z, et al. Generalized constituent nodes for simplified successive-cancellation decoding of multi-kernel polar codes. IEEE Commun Lett, 2023, 27: 1272\u20131276","journal-title":"IEEE Commun Lett"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4320-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-024-4320-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4320-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T03:48:03Z","timestamp":1758253683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-024-4320-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["4320"],"URL":"https:\/\/doi.org\/10.1007\/s11432-024-4320-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,16]]},"assertion":[{"value":"5 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"212301"}}