# Bit-Level Construction for Multiplicative-Repetition-Based Non-Binary Polar Codes +
## 3 Bit-Level Construction for Non-Binary Polar Codes
### Capacity-Based Bit-Level Construction
Available online: [[https://mediatum.ub.tum.de/doc/1613523/1613523.pdf](https://mediatum.ub.tum.de/doc/1613523/1613523.pdf)]([https://mediatum.ub.tum.de/doc/1613523/1613523.pdf](https://mediatum.ub.tum.de/doc/1613523/1613523.pdf)) (accessed on 7 July 2023). * [PERSON] (2012) [PERSON] Efficient design and decoding of polar codes. _IEEE Trans. Commun._**2012**, _60_, 3221-3227. * [PERSON] et al. (2017) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; et al. \(\beta\)-expansion: A theoretical framework for fast and recursive construction of polar codes. In Proceedings of the GLOBECOM 2017--2017 IEEE Global Communications Conference, Singapore, 4-8 December 2017; pp. 1-6. * [PERSON] and [PERSON] (2009) [PERSON]; [PERSON] Performance of polar codes with the construction using density evolution. _IEEE Commun. Lett._**2009**, _13_, 519-521. [CrossRef]
* [PERSON] and [PERSON] (2013) [PERSON]; [PERSON] How to construct polar codes. _IEEE Trans. Inf. Theory_**2013**, _59_, 6562-6582. * [PERSON] and [PERSON] (2018) [PERSON]; [PERSON]; [PERSON] Construction of polar codes for arbitrary discrete memoryless channels. _IEEE Trans. Inf. Theory_**2018**, _64_, 309-321. * [PERSON] (2022) [PERSON] Nonbinary I-polar coded modulation. _IEEE Trans. Inform. Theory_**2022**, _68_, 2266-2280. * [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON] Nonbinary polar coding for multilevel modulation. In Proceedings of the 2019 Optical Fiber Communications Conference and Exhibition (OFC), San Diego, CA, USA, 3-7 March 2019; pp. 1-3. * [PERSON] and [PERSON] (2020) [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] Analysis of non-binary polar codes over GF(3) and GF(5) with phase shift keying for short messages. In Proceedings of the 2020 IEEE 92 nd Vehicular Technology Conference (VTC2020-Fall), Victoria, BC, Canada, 18 November-16 December 2020; pp. 1-5. * [PERSON] and [PERSON] (1993) [PERSON]; [PERSON] Optimal nonuniform signaling forgaussian channels. _IEEE Trans. Inform. Theory_**1993**, _39_, 913-929. [CrossRef]
* [PERSON] et al. (1984) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Efficientmodulation for band-limited channels. _IEEE J. Sel. Areasin Commun._**1984**, \(2\), 632-647. * [PERSON] et al. (2015) [PERSON] [PERSON]; [PERSON]; [PERSON] Bandwidth efficient and rate-matched low-density parity-check coded modulation. _IEEE Trans. Commun._**2015**, _63_, 4651-4665. [CrossRef]
* [PERSON] and [PERSON] (2013) [PERSON]; [PERSON] Polar coding without alphabet extensionfor asymmetric models. _IEEE Trans. Inform. Theory_**2013**, _59_, 7829-7838. [CrossRef]
* [PERSON] and [PERSON] (2023) [PERSON]; [PERSON] Design of non-binary polar codes with shaping. In Proceedings of the 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), Moscow, Russia, 24-27 October 2023; 178-182. * [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A hybrid MLC and BICM coded-modulation framework for 6G. In Proceedings of the 2021 IEEE Globecom Workshops (GC Wkshps), Madrid, Spain, 7-11 December 2021; pp. 1-6. * [PERSON] et al. (2024) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Improved construction for multiplicative repetition based non-binary polar codes. In Proceedings of the 2024 IEEE Information Theory Workshop (ITW), Shenzhen, China, 24-28 November 2024; pp. 407-412. * [PERSON] and [PERSON] (1998) [PERSON]; [PERSON] Bandwidth-efficient turbo trellis-coded modulation using punctured component codes. _IEEE J. Sel. Areas Commun._**1998**, _16_, 206-218. **Disclaimer/Publisher's Note:** The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.