Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Information Theory and its Applications

Non-binary polar codes with channel symbol permutations.

Mao‐Ching Chiu

Published Jan 1, 2014• 11 citations
OpenAlex

Related papers

Polar coding for bidirectional broadcast channel with non-binary output alphabets

Inaba Akinori, Hideki Yagi

IEICE Technical Report; IEICE Tech. Rep.•Jul 21, 2016•0 citations

Polar Codes

Ian F. Blake

Cambridge University Press eBooks•Mar 8, 2024•2 citations

Improved Construction for Multiplicative Repetition Based Non-Binary Polar Codes

Rongchi Xu, Peiyao Chen, Ling Liu +2 more

Conventional construction of non-binary polar codes divides the synthesized channels into the 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 can not carry one symbol of$q$bits but only$i$bits,$1 \leq i<q, i \in \mathbb{Z}$, at finite block lengths. In this paper, we consider the bit-level construction for multiplicative repetition (MR) based non-binary polar codes and propose bitlevel improved construction for channel degradation method and Monte-Carlo method. Simulation results show that the proposed construction can significantly improve the decoding performance compared with the conventional construction scheme.

IEEE Information Theory Workshop (ITW)•Nov 24, 2024•1 citation

Bit-Level Construction for Multiplicative-Repetition-Based Non-Binary Polar Codes

Rongchi Xu, Peiyao Chen, Ling Liu +2 more

In this paper, we discuss non-binary polar codes using a 2×2 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≤i<q,i∈Z, 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.

Entropy•Apr 2, 2025•0 citations

A high rate non-binary QC-LDPC codes in high order Galois Field for PR2 and EPR2 channels

Mongkol Kupimai

In this paper, the new structure of high rate non-binary QC-LDPC codes based on the circulant permutation matrices is proposed. The construction of parity-check matrix of the proposed codes is obtained from (2, L) regular QC-LDPC codes. The parity-check matrix of the proposed codes has girth greater than 8. Simulation results over PR channels with the high order Galois Field show that the bit error rate and the symbol error rate performance of the proposed codes is better than those of the random non-binary LDPC codes, both in PR2 channel and EPR2 channel.

International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)•May 1, 2014•0 citations

Multi-attempt list decoding of polar codes

Peihong Yuan, Zhe Chen, Wu Yongpeng +1 more

China Communications•Apr 1, 2026•0 citations
Conventional construction of non-binary polar codes divides the synthesized channels into the frozen channels and information channels. Each information channel carries one symbol i.e.qqqbits. However, there are many middle channels with insufficient polarization, which can not carry one symbol ofqqqbits but onlyiiibits,1≤i<q,i∈Z1 \leq i<q, i \in \mathbb{Z}1≤i<q,i∈Z, at finite block lengths. In this paper, we consider the bit-level construction for multiplicative repetition (MR) based non-binary polar codes and propose bitlevel improved construction for channel degradation method and Monte-Carlo method. Simulation results show that the proposed construction can significantly improve the decoding performance compared with the conventional construction scheme.
In this paper, we discuss non-binary polar codes using a 2×2 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≤i<q,i∈Z, 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.
In this paper, the new structure of high rate non-binary QC-LDPC codes based on the circulant permutation matrices is proposed. The construction of parity-check matrix of the proposed codes is obtained from (2, L) regular QC-LDPC codes. The parity-check matrix of the proposed codes has girth greater than 8. Simulation results over PR channels with the high order Galois Field show that the bit error rate and the symbol error rate performance of the proposed codes is better than those of the random non-binary LDPC codes, both in PR2 channel and EPR2 channel.