{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T05:04:13Z","timestamp":1666328653118},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11432-019-2801-6","type":"journal-article","created":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T05:02:22Z","timestamp":1629435742000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Belief propagation list bit-flip decoder for polar codes"],"prefix":"10.1007","volume":"64","author":[{"given":"Yuyu","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaoyue","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwen","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenjie","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,18]]},"reference":[{"key":"2801_CR1","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":"2801_CR2","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/MCOM.2014.6852102","volume":"52","author":"K Niu","year":"2014","unstructured":"Niu K, Chen K, Lin J R, et al. Polar codes: primary concepts and practical decoding algorithms. IEEE Commun Mag, 2014, 52: 192\u2013203","journal-title":"IEEE Commun Mag"},{"key":"2801_CR3","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/LCOMM.2011.101811.111480","volume":"15","author":"A Alamdar-Yazdi","year":"2011","unstructured":"Alamdar-Yazdi A, Kschischang F R. A simplified successive-cancellation decoder for polar codes. IEEE Commun Lett, 2011, 15: 1378\u20131380","journal-title":"IEEE Commun Lett"},{"key":"2801_CR4","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1109\/TIT.2015.2410251","volume":"61","author":"I Tal","year":"2015","unstructured":"Tal I, Vardy A. List decoding of polar codes. IEEE Trans Inform Theor, 2015, 61: 2213\u20132226","journal-title":"IEEE Trans Inform Theor"},{"key":"2801_CR5","doi-asserted-by":"crossref","unstructured":"Asiadis O, Balatsoukas-Stimming A, Burg A. A low-complexity improved successive cancellation decoder for polar codes. In: Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 2014. 2116\u20132120","DOI":"10.1109\/ACSSC.2014.7094848"},{"key":"2801_CR6","doi-asserted-by":"crossref","unstructured":"Zhang Z, Qin K, Zhang L, et al. Progressive bit-fipping decoding of polar codes over layered critical sets. In: Proceedings of IEEE Global Communications Conference, Singapore, 2017. 1\u20136","DOI":"10.1109\/GLOCOM.2017.8254149"},{"key":"2801_CR7","unstructured":"Yu Y R, Pan Z W, Liu N, et al. Successive cancellation list bit-flip decoder for polar codes. In: Proceedings of the 10th International Conference on Wireless Communications and Signal Processing, Hangzhou, 2018. 1\u20136"},{"key":"2801_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1109\/LCOMM.2008.080017","volume":"12","author":"E Arkan","year":"2008","unstructured":"Arkan E. A performance comparison of polar codes and reed-muller codes. IEEE Commun Lett, 2008, 12: 447\u2013449","journal-title":"IEEE Commun Lett"},{"key":"2801_CR9","unstructured":"Arikan E. Polar codes: a pipelined implementation. In: Proceedings of the 4th International Symposium Broadband Communication, Melaka, 2010. 11\u201314"},{"key":"2801_CR10","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":"2801_CR11","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1109\/LCOMM.2016.2580514","volume":"20","author":"C Simsek","year":"2016","unstructured":"Simsek C, Turk K. Simplified early stopping criterion for belief-propagation polar code decoders. IEEE Commun Lett, 2016, 20: 1515\u20131518","journal-title":"IEEE Commun Lett"},{"key":"2801_CR12","doi-asserted-by":"publisher","first-page":"1576","DOI":"10.1049\/el.2017.3316","volume":"53","author":"Q Zhang","year":"2017","unstructured":"Zhang Q, Liu A J, Tong X H. Early stopping criterion for belief propagation polar decoder based on frozen bits. Electron Lett, 2017, 53: 1576\u20131578","journal-title":"Electron Lett"},{"key":"2801_CR13","doi-asserted-by":"crossref","unstructured":"Yuan B, Parhi K K. Algorithm and architecture for hybrid decoding of polar codes. In: Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 2014. 2050\u20132053","DOI":"10.1109\/ACSSC.2014.7094833"},{"key":"2801_CR14","doi-asserted-by":"crossref","unstructured":"Sun S H, Cho S G, Zhang Z Y. Post-processing methods for improving coding gain in belief propagation decoding of polar codes. In: Proceedings of IEEE Global Communications Conference, Singapore, 2017. 1\u20136","DOI":"10.1109\/GLOCOM.2017.8254247"},{"key":"2801_CR15","doi-asserted-by":"crossref","unstructured":"Elkelesh A, Ebada M, Cammerer S, et al. Belief propagation decoding of polar codes on permuted factor graphs. In: Proceedings of IEEE Wireless Communications and Networking Conference, Barcelona, 2018. 1\u20136","DOI":"10.1109\/WCNC.2018.8377158"},{"key":"2801_CR16","doi-asserted-by":"crossref","unstructured":"Doan N, Hashemi S A, Mondelli M, et al. On the decoding of polar codes on permuted factor graphs. In: Proceedings of IEEE IEEE Global Communications Conference, Abu Dhabi, 2018. 1\u20136","DOI":"10.1109\/GLOCOM.2018.8647308"},{"key":"2801_CR17","doi-asserted-by":"publisher","first-page":"1536","DOI":"10.1109\/LCOMM.2018.2850772","volume":"22","author":"A Elkelesh","year":"2018","unstructured":"Elkelesh A, Ebada M, Cammerer S, et al. Belief propagation list decoding of polar codes. IEEE Commun Lett, 2018, 22: 1536\u20131539","journal-title":"IEEE Commun Lett"},{"key":"2801_CR18","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1109\/TCOMM.2012.081512.110872","volume":"60","author":"P Trifonov","year":"2012","unstructured":"Trifonov P. Efficient design and decoding of polar codes. IEEE Trans Commun, 2012, 60: 3221\u20133227","journal-title":"IEEE Trans Commun"},{"key":"2801_CR19","doi-asserted-by":"crossref","unstructured":"Zhang H Z, Li R, Wang J, et al. Parity-check polar coding for 5G and beyond. In: Proceedings of International Conference on Communications, Kansas City, 2018, 1\u20136","DOI":"10.1109\/ICC.2018.8422462"},{"key":"2801_CR20","doi-asserted-by":"publisher","first-page":"10937","DOI":"10.1109\/ACCESS.2019.2891951","volume":"7","author":"Y R Yu","year":"2019","unstructured":"Yu Y R, Pan Z W, Liu N, et al. Belief propagation bit-flip decoder for polar codes. IEEE Access, 2019, 7: 10937\u201310946","journal-title":"IEEE Access"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-2801-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-019-2801-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-2801-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T20:18:07Z","timestamp":1666297087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-019-2801-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,18]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["2801"],"URL":"https:\/\/doi.org\/10.1007\/s11432-019-2801-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,18]]},"assertion":[{"value":"5 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"192306"}}