{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:53:45Z","timestamp":1772121225362,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T00:00:00Z","timestamp":1547424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13638-018-1327-7","type":"journal-article","created":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T07:09:49Z","timestamp":1547449789000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An efficient construction of polar codes based on the general partial order"],"prefix":"10.1186","volume":"2019","author":[{"given":"Wei","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9876-5324","authenticated-orcid":false,"given":"Liping","family":"Li","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Niu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,14]]},"reference":[{"issue":"7","key":"1327_CR1","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E. Ar\u0131kan","year":"2009","unstructured":"E. Ar\u0131kan, Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory. 55(7), 3051\u20133073 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1327_CR2","unstructured":"E. Ar\u0131kan, I. E. Telatar, in IEEE International Symposium on Information Theory (ISIT). On the rate of channel polarization, (2009), pp. 1493\u20131495."},{"issue":"12","key":"1327_CR3","doi-asserted-by":"publisher","first-page":"6253","DOI":"10.1109\/TIT.2010.2080990","volume":"56","author":"S. B. Korada","year":"2010","unstructured":"S. B. Korada, E. Sasoglu, R. Urbanke, Polar codes: characterization of exponent, bounds, and constructions. IEEE Trans. Inf. Theory. 56(12), 6253\u20136264 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1327_CR4","doi-asserted-by":"publisher","first-page":"2267","DOI":"10.1109\/TIT.2012.2228295","volume":"59","author":"S. H. Hassani","year":"2013","unstructured":"S. H. Hassani, R. Mori, T. Tanaka, R. L. Urbanke, Rate-dependent analysis of the asymptotic behavior of channel polarization. IEEE Trans. Inf. Theory. 59(4), 2267\u20132276 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1327_CR5","unstructured":"N. Hussami, S. Korada, R. Urbanke, in IEEE International Symposium on Information Theory (ISIT). Performance of polar codes for channel and source coding, (2009), pp. 1488\u20131492."},{"key":"1327_CR6","unstructured":"A. Eslami, H. Pishro-Nik, in 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton). On bit error rate performance of polar codes in finite regime, (2010), pp. 188\u2013194."},{"key":"1327_CR7","unstructured":"J. Guo, M. Qin, A. G. i Fabregas, P. H. Siegel, in 2014 IEEE International Symposium on Information Theory Proceedings (ISIT). Enhanced belief propagation decoding of polar codes through concatenation, (2014), pp. 2987\u20132991."},{"key":"1327_CR8","unstructured":"U. U. Fayyaz, J. R. Barry, in 2013 IEEE International Conference on Communications (ICC). Polar codes for partial response channels, (2013), pp. 4337\u20134341."},{"key":"1327_CR9","doi-asserted-by":"crossref","unstructured":"E. Sasoglu, E. Telatar, E. Arikan, in IEEE Information Theory Workshop(ITW). Polarization for arbitrary discrete memoryless channels, (2009).","DOI":"10.1109\/ITW.2009.5351487"},{"key":"1327_CR10","unstructured":"R. Mori, T. Tanaka, in IEEE Information Theory Workshop(ITW). Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes, (2010), pp. 1\u20135."},{"key":"1327_CR11","unstructured":"A. G. Sahebi, S. S. Pradhan, in 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton). Multilevel polarization of polar codes over arbitrary discrete memoryless channels, (2011), pp. 1718\u20131725."},{"issue":"7","key":"1327_CR12","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1109\/LCOMM.2009.090428","volume":"13","author":"R. Mori","year":"2009","unstructured":"R. Mori, T. Tanaka, Performance of polar codes with the construction using density evolution. IEEE Commun. Lett.13(7), 519\u2013521 (2009).","journal-title":"IEEE Commun. Lett."},{"issue":"10","key":"1327_CR13","doi-asserted-by":"publisher","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","volume":"59","author":"I. Tal","year":"2013","unstructured":"I. Tal, A. Vardy, How to construct polar codes. IEEE Trans. Inf. Theory. 59(10), 6562\u20136582 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1327_CR14","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1109\/TCOMM.2012.081512.110872","volume":"60","author":"P. Trifonov","year":"2012","unstructured":"P. Trifonov, Efficient design and decoding of polar codes. IEEE Trans. Commun.60(11), 3221\u20133227 (2012).","journal-title":"IEEE Trans. Commun."},{"issue":"7","key":"1327_CR15","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/LCOMM.2014.2325811","volume":"18","author":"D. Wu","year":"2014","unstructured":"D. Wu, Y. Li, Y. Sun, Construction and block error rate analysis of polar codes over AWGN channel based on Gaussian approximation. IEEE Commun. Lett.18(7), 1099\u20131102 (2014).","journal-title":"IEEE Commun. Lett."},{"key":"1327_CR16","unstructured":"J. Dai, K. Niu, Z. Si, J. Lin, Evaluation and optimization of Gaussian approximation for polar codes, (2016). \n                    https:\/\/arxiv.org\/abs\/1511.07236\n                    \n                  ."},{"key":"1327_CR17","unstructured":"C. Schurch, in IEEE International Symposium on Information Theory (ISIT). A partial order for the synthesized channels of a polar code, (2016), pp. 220\u2013224."},{"key":"1327_CR18","unstructured":"M. Bardet, V. Dragoi, A. Otmani, J. -P. Tillich, Algebraic properties of polar codes from a new polynomial formalism, (2016). \n                    https:\/\/arxiv.org\/abs\/1601.06215\n                    \n                  ."},{"key":"1327_CR19","doi-asserted-by":"crossref","unstructured":"M. Mondelli, S. H. Hassani, R. Urbanke, in IEEE International Symposium on Information Theory (ISIT). Construction of polar codes with sublinear complexity, (2017).","DOI":"10.1109\/ISIT.2017.8006850"},{"key":"1327_CR20","unstructured":"G. He, J. -C. Belfiore, I. Land, G. Yang, X. Liu, Y. Chen, R. Li, J. Wang, Y. Ge, R. Zhang, W. Tong, \u03b2-expansion: a theoretical framework for fast and recursive construction of polar codes, (2017). \n                    https:\/\/arxiv.org\/abs\/1704.05709\n                    \n                  ."},{"key":"1327_CR21","unstructured":"W. Wang, L. Li, in IEEE International Wireless Communications and Mobile Computing Conference. Efficient construction of polar codes, (2017), pp. 1594\u20131598."},{"key":"1327_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern coding theory","author":"T. Richardson","year":"2008","unstructured":"T. Richardson, R. Urbanke, Modern coding theory (Cambridge University Press, Cambridge, 2008)."},{"key":"1327_CR23","unstructured":"S. B. Korada, Polar codes for channel and source coding. PhD Thesis, (2009)."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-018-1327-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-018-1327-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-018-1327-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T19:07:26Z","timestamp":1578942446000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-018-1327-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,14]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1327"],"URL":"https:\/\/doi.org\/10.1186\/s13638-018-1327-7","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,14]]},"assertion":[{"value":"17 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"12"}}