Related papers: Polar Subcodes
Simulation results illustrating the performance and complexity of the sequential successive cancellation decoding algorithm are presented for the case of polar subcodes with Arikan and large kernels, as well as for extended BCH\ codes.…
Polar code lattices are formed from binary polar codes using Construction D. In this paper, we propose a design technique for finite-dimension polar code lattices. The dimension $n$ and target probability of decoding error are parameters…
A new family of codes based on polar codes, soft concatenation and list+CRC decoding is proposed. Numerical experiments show the performance competitive with industry standards and Tal, Vardy approach.
Polar codes have received growing attention in the past decade and have been selected as the coding scheme for the control channel in the fifth generation (5G) wireless communication systems. However, the conventional polar codes have only…
Motivated by the need for channel codes with low-complexity soft-decision decoding algorithms, we consider the recursive Plotkin concatenation of optimal low-rate and high-rate codes based on simplex codes and their duals. These component…
We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft…
Polar codes with memory (PCM) are proposed in this paper: a pair of consecutive code blocks containing a controlled number of mutual information bits. The shared mutual information bits of the succeeded block can help the failed block to…
Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of…
Deep polar codes are pre-transformed polar codes that employ a multi-layered polar kernel transformation strategy to enhance code performance in short blocklength regimes. However, like conventional polar codes, their block length is…
Polar codes, introduced by Arikan, achieve symmetric capacity of any discrete memoryless channels under low encoding and decoding complexity. Recently, non-binary polar codes have been investigated. In this paper, we calculate error…
Polar codes are considered the latest major breakthrough in coding theory. Polar codes were introduced by Ar{\i}kan in 2008. In this letter, we show that the binary polar codes are the same as the optimized codes for bitwise multistage…
In this work we propose an encoding and decoding framework for staircase codes based on non-systematic polar codes as component codes. The staircase structure allows for efficient parallelized decoding, while the polar component codes allow…
Permutation decoding gained recent interest as it can exploit the symmetries of a code in a parallel fashion. Moreover, it has been shown that by viewing permuted polar codes as polar subcodes, the set of usable permutations in permutation…
Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of…
This paper proposes a polar code construction scheme that reduces constituent-code supplemented decoding latency. Constituent codes are the sub-codewords with specific patterns. They are used to accelerate the successive cancellation…
Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…
Classical source polar codes require the construction of frozen sets for given sources. While this scheme offers excellent theoretical performance, it faces challenges in practical data compression systems, including sensitivity to the…
We propose a belief propagation list (BPL) decoder with comparable performance to the successive cancellation list (SCL) decoder of polar codes, which already achieves the maximum likelihood (ML) bound of polar codes for sufficiently large…
This paper presents a polarization-driven (PD) shortening technique for the design of rate-compatible polar codes. The proposed shortening strategy consists of reducing the generator matrix by relating its row index with the channel…
A polar code extension method which supports incremental redundancy hybrid ARQ(IR-HARQ) is proposed in this paper. By copying information bits to proper positions of the extend part, the extended polar code can give additional protection…