Related papers: Multilevel Binary Polar-Coded Modulation Achieving…
In this paper, polar codes for the $m$-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Ar{\i}kan's polarization technique applied individually to each user transforms independent uses of a $m$-user…
A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send different confidential (and non-confidential) information to…
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…
Consider a single-user or multiple-access channel with a large output alphabet. A method to approximate the channel by an upgraded version having a smaller output alphabet is presented and analyzed. The original channel is not necessarily…
Information-theoretic work for wiretap channels is mostly based on random coding schemes. Designing practical coding schemes to achieve information-theoretic security is an important problem. By applying the two recently developed…
Polar codes are designed for parallel binary-input additive white Gaussian noise (BiAWGN) channels with an average power constraint. The two main design choices are: the mapping between codeword bits and channels of different quality, and…
A novel structure of polar codes is proposed for finite-state modulation (FSM), in order to improve polarization under it, and approach the polarization efficiency that conventional polar codes achieve under memoryless channels. We choose a…
Different polar coding schemes are proposed for the memoryless degraded broadcast channel under different reliability and secrecy requirements: layered decoding and/or layered secrecy. In this setting, the transmitter wishes to send…
This study proposes \emph{modular arithmetic erasure channels} (MAECs), a novel class of erasure-like channels with an input alphabet that need not be binary. This class contains the binary erasure channel (BEC) and some other known…
Polar codes have received increasing attention in the past decade, and have been selected for the next generation of wireless communication standard. Most research on polar codes has focused on codes constructed from a $2\times2$…
We propose a method to increase the capacity achieved by uniform prior in discrete memoryless channels (DMC) with high input cardinality. It consists in appropriately reducing the input set. Different design criteria of the input subset are…
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…
The connections between variable nodes and check nodes have a great influence on the performance of low-density parity-check (LDPC) codes. Inspired by the unique structure of polar code's generator matrix, we proposed a new method of…
The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially-concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the…
The channel polarization behavior of polar codes under noise with memory is investigated. By introducing a genie-aided channel model, we first show that the polarized subchannels still converge to extremal channels under the standard polar…
Recently, a purely quantum version of polar codes has been proposed in [1] based on a quantum channel combining and splitting procedure, where a randomly chosen two-qubit Clifford unitary acts as channel combining operation. Here, we…
Polar codes were introduced by Arikan in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient…
With the evolution from 5G to 6G, ultra-reliable low-latency communication (URLLC) faces increasingly stringent performance requirements. Lower latency constraints demand shorter channel coding lengths, which can severely degrade decoding…
Resistive memories are considered a promising memory technology enabling high storage densities with in-memory computing capabilities. However, the readout reliability of resistive memories is impaired due to the inevitable existence of…
Current deterministic algorithms for the construction of polar codes can only be argued to be practical for channels with small input alphabet sizes. In this paper, we show that any construction algorithm for channels with moderate input…