相关论文: Polar Decomposition of Mutual Information over Com…

The polar transformation of a binary erasure channel (BEC) can be exactly approximated by other BECs. Ar{\i}kan proposed that polar codes for a BEC can be efficiently constructed by using its useful property. This study proposes a new class…

The depolarization channel is usually modelled as a quantum operation that destroys all input information, replacing it by a completely chaotic state. For qubits this has a quite intuitive interpretation as a shrinking of the Bloch sphere.…

Ar{\i}kan's polar coding, is by now a well studied technique that allows achieving the symmetric capacity of binary input memoryless channels with low complexity encoding and decoding, provided that the polar decoding architecture is used…

It is proposed a complex valued channel encoding for multidimensional data. The basic approach contains overlapping of complex nonlinear mappings. Its development leads to sparse representation of multi-channel data, increasing their…

It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The…

We construct a new entanglement-assisted quantum polar coding scheme which achieves the symmetric coherent information rate by synthesizing "amplitude" and "phase" channels from a given, arbitrary quantum channel. We first demonstrate the…

Using a mild variant of polar codes we design linear compression schemes compressing Hidden Markov sources (where the source is a Markov chain, but whose state is not necessarily observable from its output), and to decode from Hidden Markov…

Taking a functional approach, we derive a general expression for the gradient of the Mutual Information (MI) with respect to the system parameters in the stochastic systems. This expression covers the cases in which the system input depends…

We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information and in the latter the…

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…

The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying…

$2^m$-ary modulation creates $m$ bit channels which are neither independent nor identical, and this causes problems when applying polar coding because polar codes are designed for independent identical channels. Different from the existing…

In 2008 Arikan proposed polar coding [arXiv:0807.3917] which we summarize as follows: (a) From the root channel $W$ synthesize recursively a series of channels $W_N^{(1)},\dotsc,W_N^{(N)}$. (b) Select sophisticatedly a subset $A$ of…

-We develop a polar coding scheme for empirical coordination in a two-node network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction. In the case of non-causal encoding and…

Numerical upper and lower bounds to the information rate transferred through the additive white Gaussian noise channel affected by discrete-time multiplicative autoregressive moving-average (ARMA) phase noise are proposed in the paper. The…

To provide an efficient approach to characterize the input-output mutual information (MI) under additive white Gaussian noise (AWGN) channel, this short report fits the curves of exact MI under multilevel quadrature amplitude modulation…

We examine the polarization signal of the cosmic microwave background radiation associated with distant clusters. The polarization is induced by the Thomson scattering of microwave photons with ionized gas of clusters and contains…

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use the Arikan construction, the resulting channels will polarize to one of five possible extremals, on each of…

A multilevel coded modulation scheme is studied that uses solely binary polar codes and Honda-Yamamoto probabilistic shaping. The scheme is shown to achieve the capacity of discrete memoryless channels with input alphabets of cardinality a…

This paper studies a generalization of sparse superposition codes (SPARCs) for communication over the complex additive white Gaussian noise (AWGN) channel. In a SPARC, the codebook is defined in terms of a design matrix, and each codeword…