Related papers: Symbol-Index-Feedback Polar Coding Schemes for Low…
A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (\mbox{RCP}) codes are proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes.…
We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacity-achieving quantum polar encoding can be reduced by the proposed low-complexity…
Although power line communication (PLC) systems are available everywhere, unfortunately these systems are not suitable for information transmission due to the effects of the impulsive noise. Therefore, many previous studies on channel codes…
This paper investigates universal polar coding schemes. In particular, a notion of ordering (called convolutional path) is introduced between probability distributions to determine when a polar compression (or communication) scheme designed…
A framework is proposed that allows for a joint description and optimization of both binary polar coding and $2^m$-ary digital pulse-amplitude modulation (PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded modulation…
Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere…
Benefiting from performance advantages under short code lengths, polar codes are well-suited for certain scenarios, such as the future Internet of Things (IoT) applications that require high reliability and low power. Existing list flip…
We propose a unitary precoding scheme, namely polar-precoding, to improve the performance of polar-coded MIMO systems. In contrast to the traditional design of MIMO precoding criteria, the proposed polar-precoding scheme relies on the…
Progress in designing channel codes has been driven by human ingenuity and, fittingly, has been sporadic. Polar codes, developed on the foundation of Arikan's polarization kernel, represent the latest breakthrough in coding theory and have…
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…
A polar coding scheme for fading channels is proposed in this paper. More specifically, the focus is Gaussian fading channel with a BPSK modulation technique, where the equivalent channel could be modeled as a binary symmetric channel with…
Polar codes are a new family of error correction codes for which efficient hardware architectures have to be defined for the encoder and the decoder. Polar codes are decoded using the successive cancellation decoding algorithm that includes…
Nowadays polar codes are becoming one of the most favorable capacity achieving error correction codes for their low encoding and decoding complexity. However, due to the large code length required by practical applications, the few existing…
Systematic polar codes are shown to outperform non-systematic polar codes in terms of the bit-error-rate (BER) performance. However theoretically the mechanism behind the better performance of systematic polar codes is not yet clear. In…
Channel coding over arbitrarily-permuted parallel channels was first studied by Willems et al. (2008). This paper introduces capacity-achieving polar coding schemes for arbitrarily-permuted parallel channels where the component channels are…
Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively,…
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…
We construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents $\mathsf X$ and $\mathsf Y$, which communicate over a discrete memoryless channel (DMC) such that the joint distribution of…
Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure by transmitting random bits that are encoded as qubits and sent over a quantum channel, followed by classical…
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric…