Related papers: Adjacent-Bits-Swapped Polar codes: A new code cons…
We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects $K$ best among $N$ possible polar bit-channels…
It's known that the bit errors of polar codes with successive cancellation (SC) decoding are coupled. We call the coupled information bits the correlated bits. In this paper, concatenation schemes are studied for polar codes (as inner…
We prove that, for all binary-input symmetric memoryless channels, polar codes enable reliable communication at rates within $\epsilon > 0$ of the Shannon capacity with a block length, construction complexity, and decoding complexity all…
Bit-interleaved coded modulation (BICM) and multilevel coded modulation (MLC) are commonly used to combine polar codes with high order modulation. While BICM benefits from simple design and the separation of coding and modulation, MLC shows…
ABS+ polar codes are a generalization of Arikan polar codes that provides much faster polarization. We present an LLR-domain version of the SCL decoder of ABS+ polar codes. Furthermore, we optimize the SCL algorithm in order to reduce the…
This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement learning techniques. The proposed method provides a novel technique…
Polar codes have been selected as the channel coding scheme for control channel in the fifth generation (5G) communication system thanks to their capacity achieving characteristics. However, the traditional polar codes support only codes…
Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a precoding step before the polar transform. In this scheme, the polar transform (as a mapper) and the…
Polar codes are introduced for discrete memoryless broadcast channels. For $m$-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from $m$ independent messages to one codeword while…
A pruned variant of polar coding is proposed for binary erasure channels. For sufficiently small $\varepsilon>0$, we construct a series of capacity achieving codes with block length $N=\varepsilon^{-5}$, code rate…
A latest coding scheme named polarization-adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near-bound performance, the list size of list decoding…
In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed…
A pruned variant of polar coding is reinvented for all binary erasure channels. For small $\varepsilon>0$, we construct codes with block length $\varepsilon^{-5}$, code rate $\text{Capacity}-\varepsilon$, error probability $\varepsilon$,…
Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern…
An efficient algorithm for the construction of polar codes for higher-order modulation is presented based on information-theoretic principles. The bit reliabilities after successive demapping are estimated using the LM-rate, an achievable…
Polar codes have emerged as the most favorable channel codes for their unique capacity-achieving property. To date, numerous works have been reported for efficient design of polar codes decoder. However, these prior efforts focused on…
A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Moreover, a construction of…
This paper presents our low-latency Polar code encoders and decoders developed for the 2025 International Symposium on Topics in Coding (ISTC 2025) contest, which challenges participants to implement the fastest possible channel code…
Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list…
Deep polar codes, employing multi-layered polar kernel pre-transforms in series, are recently introduced variants of pre-transformed polar codes. These codes have demonstrated the ability to reduce the number of minimum weight codewords,…