{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T14:08:10Z","timestamp":1765807690198},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T00:00:00Z","timestamp":1559174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T00:00:00Z","timestamp":1559174400000},"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":[[2019,8]]},"DOI":"10.1007\/s11432-018-9743-0","type":"journal-article","created":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:55:32Z","timestamp":1559382932000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sphere decoder for polar codes concatenated with cyclic redundancy check"],"prefix":"10.1007","volume":"62","author":[{"given":"Yongrun","family":"Yu","sequence":"first","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":"Xiaosi","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,30]]},"reference":[{"key":"9743_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":"9743_CR2","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":"9743_CR3","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/LCOMM.2012.090312.121501","volume":"16","author":"K Niu","year":"2012","unstructured":"Niu K, Chen K. CRC-aided decoding of polar codes. IEEE Commun Lett, 2012, 16: 1668\u20131671","journal-title":"IEEE Commun Lett"},{"key":"9743_CR4","first-page":"1","volume-title":"BER comparison between convolutional, turbo, LDPC, and polar codes","author":"B Tahir","year":"2017","unstructured":"Tahir B, Schwarz S, Rupp M. BER comparison between convolutional, turbo, LDPC, and polar codes. In: Proceedings of the 24th International Conference on Telecommunications (ICT), Limassol, 2017. 1\u20137"},{"key":"9743_CR5","doi-asserted-by":"publisher","first-page":"3145","DOI":"10.1049\/iet-com.2014.0227","volume":"8","author":"C Cao","year":"2014","unstructured":"Cao C, Kuang J, Fei Z, et al. Low complexity list successive cancellation decoding of polar codes. IET Commun, 2014, 8: 3145\u20133149","journal-title":"IET Commun"},{"key":"9743_CR6","doi-asserted-by":"publisher","first-page":"022309","DOI":"10.1007\/s11432-017-9128-x","volume":"61","author":"Q Y Xu","year":"2018","unstructured":"Xu Q Y, Pan Z W, Liu N, et al. A complexity-reduced fast successive cancellation list decoder for polar codes. Sci China Inf Sci, 2018, 61: 022309","journal-title":"Sci China Inf Sci"},{"key":"9743_CR7","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1017\/CBO9780511803253","volume-title":"Channel Codes Classical And Modern","author":"W E Ryan","year":"2009","unstructured":"Ryan W E, Lin S. Channel Codes Classical And Modern. New York: Cambridge University Press Ltd., 2009. 110\u2013111"},{"key":"9743_CR8","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1109\/18.915680","volume":"47","author":"P Kazakov","year":"2001","unstructured":"Kazakov P. Fast calculation of the number of minimum-weight words of CRC codes. IEEE Trans Inform Theor, 2001, 47: 1190\u20131195","journal-title":"IEEE Trans Inform Theor"},{"key":"9743_CR9","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1109\/26.231911","volume":"41","author":"G Castagnoli","year":"1993","unstructured":"Castagnoli G, Brauer S, Herrmann M. Optimization of cyclic redundancy-check codes with 24 and 32 parity bits. IEEE Trans Commun, 1993, 41: 883\u2013892","journal-title":"IEEE Trans Commun"},{"key":"9743_CR10","first-page":"1967","volume-title":"Code based efficient maximum-likelihood decoding of short polar codes","author":"S Kahraman","year":"2012","unstructured":"Kahraman S, Celebi M E. Code based efficient maximum-likelihood decoding of short polar codes. In: Proceedings of 2012 IEEE International Symposium on Information Theory (ISIT), Cambridge, 2012. 1967\u20131971"},{"key":"9743_CR11","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/LCOMM.2014.010214.131826","volume":"18","author":"K Niu","year":"2014","unstructured":"Niu K, Chen K, Lin J. Low-complexity sphere decoding of polar codes based on optimum path metric. IEEE Commun Lett, 2014, 18: 332\u2013335","journal-title":"IEEE Commun Lett"},{"key":"9743_CR12","first-page":"236","volume-title":"Efficient sphere decoding of polar codes","author":"J Guo","year":"2015","unstructured":"Guo J, Fabregas A G. Efficient sphere decoding of polar codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015. 236\u2013240"},{"key":"9743_CR13","first-page":"1346","volume-title":"List sphere decoding of polar codes","author":"S A Hashemi","year":"2015","unstructured":"Hashemi S A, Condo C, Gross W J. List sphere decoding of polar codes. In: Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 2015. 1346\u20131350"},{"key":"9743_CR14","first-page":"1730","volume-title":"Matrix reordering for efficient list sphere decoding of polar codes","author":"S A Hashemi","year":"2016","unstructured":"Hashemi S A, Condo C, Gross W J. Matrix reordering for efficient list sphere decoding of polar codes. In: Proceedings of 2016 IEEE International Symposium on Circuits and Systems (ISCAS), Montreal, 2016. 1730\u20131733"},{"key":"9743_CR15","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1109\/TVT.2017.2761262","volume":"67","author":"C Husmann","year":"2018","unstructured":"Husmann C, Nikolaou P C, Nikitopoulos K. Reduced latency ML polar decoding via multiple sphere-decoding tree searches. IEEE Trans Veh Technol, 2018, 67: 1835\u20131839","journal-title":"IEEE Trans Veh Technol"},{"key":"9743_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. Efficient design and decoding of polar codes. IEEE Trans Commun, 2012, 60: 3221\u20133227","journal-title":"IEEE Trans Commun"},{"key":"9743_CR17","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":"9743_CR18","first-page":"1","volume-title":"Beta-expansion: a theoretical framework for fast and recursive construction of polar codes","author":"G He","year":"2017","unstructured":"He G, Belfiore J C, Land I, et al. Beta-expansion: a theoretical framework for fast and recursive construction of polar codes. In: Proceedings of IEEE Global Communications Conference, Singapore, 2017. 1\u20136"},{"key":"9743_CR19","first-page":"145","volume-title":"Cyclic redundancy code (CRC) polynomial selection for embedded networks","author":"P Koopman","year":"2004","unstructured":"Koopman P, Chakravarty T. Cyclic redundancy code (CRC) polynomial selection for embedded networks. In: Proceedings of International Conference on Dependable Systems and Networks, Florence, 2004. 145\u2013154"},{"key":"9743_CR20","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TIT.2002.800499","volume":"48","author":"E Agrell","year":"2002","unstructured":"Agrell E, Eriksson T, Vardy A, et al. Closest point search in lattices. IEEE Trans Inform Theor, 2002, 48: 2201\u20132214","journal-title":"IEEE Trans Inform Theor"},{"key":"9743_CR21","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1109\/LCOMM.2017.2672539","volume":"21","author":"Q Zhang","year":"2017","unstructured":"Zhang Q, Liu A, Pan X, et al. CRC code design for list decoding of polar codes. IEEE Commun Lett, 2017, 21: 1229\u20131232","journal-title":"IEEE Commun Lett"},{"key":"9743_CR22","doi-asserted-by":"publisher","first-page":"2806","DOI":"10.1109\/TSP.2005.850352","volume":"53","author":"B Hassibi","year":"2005","unstructured":"Hassibi B, Vikalo H. On the sphere-decoding algorithm I. Expected complexity. IEEE Trans Signal Process, 2005, 53: 2806\u20132818","journal-title":"IEEE Trans Signal Process"},{"key":"9743_CR23","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1109\/TCOMM.2005.851590","volume":"53","author":"W Zhao","year":"2005","unstructured":"Zhao W, Giannakis G B. Sphere decoding algorithms with improved radius search. IEEE Trans Commun, 2005, 53: 1104\u20131109","journal-title":"IEEE Trans Commun"},{"key":"9743_CR24","doi-asserted-by":"publisher","first-page":"5165","DOI":"10.1109\/TSP.2015.2439211","volume":"63","author":"A Balatsoukas-Stimming","year":"2015","unstructured":"Balatsoukas-Stimming A, Parizi M B, Burg A. LLR-based successive cancellation list decoding of polar codes. IEEE Trans Signal Process, 2015, 63: 5165\u20135179","journal-title":"IEEE Trans Signal Process"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9743-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-018-9743-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9743-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T11:22:59Z","timestamp":1681212179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-018-9743-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,30]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9743"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9743-0","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,30]]},"assertion":[{"value":"2 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"82303"}}