{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:40:35Z","timestamp":1760031635185,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:00:00Z","timestamp":1743552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&amp;D Program of China","award":["2021YFA1000500","62171356","62271380"],"award-info":[{"award-number":["2021YFA1000500","62171356","62271380"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2021YFA1000500","62171356","62271380"],"award-info":[{"award-number":["2021YFA1000500","62171356","62271380"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, we discuss non-binary polar codes using a 2\u00d72 matrix over a Galois field GF(2q) as the kernel. Conventional construction of non-binary polar codes divides the synthesized channels into frozen channels and information channels. Each information channel carries one symbol, i.e., q bits. However, there are many middle channels with insufficient polarization, which cannot carry one symbol of q bits but only i bits, 1\u2264i&lt;q,i\u2208Z, at finite block length. In this paper, we consider bit-level construction for multiplicative repetition (MR)-based non-binary polar codes and propose a bit-level construction based on the two following methods. We first calculate the error probability and channel capacity lower bound of each synthesized channel based on the channel degradation method, and then determine both the number and index of the carried bits for each synthesized channel according to the symbol error probability and capacity. To reduce complexity, we also introduce a Monte-Carlo method. We compute the error probability of each synthesized channel carrying i information bits and select the optimal construction that can minimize the union bound of the error probability. Finally, an improved construction-based probabilistic shaping method for MR-based non-binary polar codes is considered. Simulation results show that the proposed construction significantly improved the decoding performance compared with the conventional construction scheme.<\/jats:p>","DOI":"10.3390\/e27040377","type":"journal-article","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:43:33Z","timestamp":1743572613000},"page":"377","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bit-Level Construction for Multiplicative-Repetition-Based Non-Binary Polar Codes"],"prefix":"10.3390","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8817-6933","authenticated-orcid":false,"given":"Rongchi","family":"Xu","sequence":"first","affiliation":[{"name":"The State Key Laboratory of ISN, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peiyao","family":"Chen","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of ISN, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0954-6986","authenticated-orcid":false,"given":"Ling","family":"Liu","sequence":"additional","affiliation":[{"name":"The Guangzhou Institute of Technology, Xidian University, Guangzhou 510555, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1052-5973","authenticated-orcid":false,"given":"Min","family":"Zhu","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of ISN, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6161-5493","authenticated-orcid":false,"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of ISN, Xidian University, Xi\u2019an 710071, China"},{"name":"The Guangzhou Institute of Technology, Xidian University, Guangzhou 510555, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels","volume":"55","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1109\/TIT.2015.2410251","article-title":"List decoding of polar codes","volume":"61","author":"Tal","year":"2015","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1109\/LCOMM.2012.090312.121501","article-title":"CRC-aided decoding of polar codes","volume":"16","author":"Niu","year":"2012","journal-title":"IEEE Commun. Lett."},{"key":"ref_4","unstructured":"(2018, April 05). 3rd Generation Partnership Project (3GPP) TS 38.212. Multiplexing and Channel Coding. V.15.1.0. Available online: https:\/\/www.3gpp.org\/ftp\/Specs\/archive\/38_series\/38.212\/."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"\u015ea\u015fo\u01e7lu, E., Telatar, E., and Ar\u0131kan, E. (2009, January 11\u201316). Polarization for arbitrary discrete memoryless channels. Proceedings of the 2009 IEEE Information Theory Workshop, Taormina, Italy.","DOI":"10.1109\/ITW.2009.5351487"},{"key":"ref_6","unstructured":"Chiu, M. (2014, January 26\u201329). Nonbinary polar codes with channel symbol permutations. Proceedings of the 2014 International Symposium on Information Theory and Its Applications, Victoria, BC, Canada."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Mori, R., and Tanaka, T. (September, January 30). Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes. Proceedings of the 2010 IEEE Information Theory Workshop, Dublin, Ireland.","DOI":"10.1109\/CIG.2010.5592755"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Cheng, N., Zhang, R., Ge, Y., Shi, W., Zhang, Q., and Shen, X.S. (2016, January 13\u201315). Encoder and list decoder of Reed-Solomon kernel based polar codes. Proceedings of the 2016 8th International Conference on Wireless Communications & Signal Processing (WCSP), Yangzhou, China.","DOI":"10.1109\/WCSP.2016.7752615"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/JSAC.2015.2504278","article-title":"Mixed-kernels constructions of polar codes","volume":"34","author":"Presman","year":"2016","journal-title":"J. Sel. Areas Commun."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"6788","DOI":"10.1109\/TIT.2011.2162259","article-title":"Multiplicatively repeated nonbinary LDPC codes","volume":"57","author":"Kasai","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Chen, P., and Bai, B. (2018, January 3\u20136). Design and performance of the polar coded modulation for high mobility communications. Proceedings of the 2018 IEEE 87th Vehicular Technology Conference (VTC Spring), Porto, Portugal.","DOI":"10.1109\/VTCSpring.2018.8417807"},{"key":"ref_12","first-page":"36","article-title":"Nonbinary polar coding with low decoding latency and complexity","volume":"1","author":"Chen","year":"2023","journal-title":"J. Inf. Intell."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Yuan, P., and Steiner, F. (2018, January 3\u20137). Construction and decoding algorithms for polar codes based on 2\u00d72 non-binary kernel. Proceedings of the 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), Hong Kong, China.","DOI":"10.1109\/ISTC.2018.8625284"},{"key":"ref_14","unstructured":"Yuan, P. (2021). Polar Coding with Complexity-Adaptive Decoding and Time-Varying Channels. [Ph.D. Thesis, Technische Universit\u00e4t M\u00fcnchen]. Available online: https:\/\/mediatum.ub.tum.de\/doc\/1613523\/1613523.pdf."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"3221","DOI":"10.1109\/TCOMM.2012.081512.110872","article-title":"Efficient design and decoding of polar codes","volume":"60","author":"Trifonov","year":"2012","journal-title":"IEEE Trans. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"He, G., Belfiore, J.C., Land, I., Yang, G., Liu, X., Chen, Y., Li, R., Wang, J., Ge, Y., and Zhang, R. (2017, January 4\u20138). \u03b2-expansion: A theoretical framework for fast and recursive construction of polar codes. Proceedings of the GLOBECOM 2017\u20142017 IEEE Global Communications Conference, Singapore.","DOI":"10.1109\/GLOCOM.2017.8254146"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/LCOMM.2009.090428","article-title":"Performance of polar codes with the construction using density evolution","volume":"13","author":"Mori","year":"2009","journal-title":"IEEE Commun. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","article-title":"How to construct polar codes","volume":"59","author":"Tal","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/TIT.2017.2765663","article-title":"Construction of polar codes for arbitrary discrete memoryless channels","volume":"64","author":"Gulcu","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2266","DOI":"10.1109\/TIT.2022.3141085","article-title":"Nonbinary I-polar coded modulation","volume":"68","author":"Chiu","year":"2022","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Cayci, S., Koike-Akino, T., and Wang, Y. (2019, January 3\u20137). Nonbinary polar coding for multilevel modulation. Proceedings of the 2019 Optical Fiber Communications Conference and Exhibition (OFC), San Diego, CA, USA.","DOI":"10.1364\/OFC.2019.W3H.4"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Falk, M., Bauch, G., and Nissen, I. (December, January 18). Analysis of non-binary polar codes over GF(3) and GF(5) with phase shift keying for short messages. Proceedings of the 2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall), Victoria, BC, Canada.","DOI":"10.1109\/VTC2020-Fall49728.2020.9348796"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/18.256499","article-title":"Optimal nonuniform signaling forgaussian channels","volume":"39","author":"Kschischang","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1109\/JSAC.1984.1146101","article-title":"Efficientmodulation for band-limited channels","volume":"2","author":"Forney","year":"1984","journal-title":"IEEE J. Sel. Areasin Commun."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4651","DOI":"10.1109\/TCOMM.2015.2494016","article-title":"Bandwidth efficient and rate-matched low-density parity-check coded modulation","volume":"63","author":"Bocherer","year":"2015","journal-title":"IEEE Trans. Commun."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"7829","DOI":"10.1109\/TIT.2013.2282305","article-title":"Polar coding without alphabet extensionfor asymmetric models","volume":"59","author":"Honda","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Karakchieva, L., and Trifonov, P. (2023;, January 24\u201327). Design of non-binary polar codes with shaping. Proceedings of the 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), Moscow, Russia.","DOI":"10.1109\/Redundancy59964.2023.10330203"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Yuan, R., Fang, J., Xu, R., Bai, B., and Wang, J. (2021, January 7\u201311). A hybrid MLC and BICM coded-modulation framework for 6G. Proceedings of the 2021 IEEE Globecom Workshops (GC Wkshps), Madrid, Spain.","DOI":"10.1109\/GCWkshps52748.2021.9682143"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Xu, R., Chen, P., Liu, L., Zhu, M., and Bai, B. (2024, January 24\u201328). Improved construction for multiplicative repetition based non-binary polar codes. Proceedings of the 2024 IEEE Information Theory Workshop (ITW), Shenzhen, China.","DOI":"10.1109\/ITW61385.2024.10806916"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1109\/49.661109","article-title":"Bandwidth-efficient turbo trellis-coded modulation using punctured component codes","volume":"16","author":"Robertson","year":"1998","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/4\/377\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:08:32Z","timestamp":1760029712000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/4\/377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,2]]},"references-count":30,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["e27040377"],"URL":"https:\/\/doi.org\/10.3390\/e27040377","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,4,2]]}}}