Related papers: Asymptotic Distribution of Multilevel Channel Pola…
The Poltyrev bound provides a very tight upper bound on the decoding error probability when using binary linear codes for transmission over the binary symmetric channel and the additive white Gaussian noise channel, making use of the code's…
In this paper, we study the asymptotic performance of Abelian group codes for the lossy source coding problem for arbitrary discrete (finite alphabet) memoryless sources as well as the channel coding problem for arbitrary discrete (finite…
We demonstrate an isotropic depolarizing channel with a controllable degree of depolarization. The depolarizer is composed of four birefringent crystals and half-wave plates. Quantum process tomography results of the depolarization effect…
A simple model describing depolarization channels with zero-bandwidth environment is presented and exactly solved. The environment is modelled by Lorentzian, telegraphic and Gaussian zero-bandwidth noises. Such channels can go beyond the…
It is known that polar codes can be efficiently constructed for binary-input channels. At the same time, existing algorithms for general input alphabets are less practical because of high complexity. We address the construction problem for…
We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly…
A framework is proposed that allows for a joint description and optimization of both binary polar coding and the multilevel coding (MLC) approach for $2^m$-ary digital pulse-amplitude modulation (PAM). The conceptual equivalence of polar…
In the present paper we consider the problem of resonance line polarization formed in the spherically symmetric expanding atmospheres. For the solution of the concerned polarized transfer equation we use the comoving frame formulation, and…
We consider a queue-channel model that captures the waiting time-dependent degradation of information bits as they wait to be transmitted. Such a scenario arises naturally in quantum communications, where quantum bits tend to decohere…
A probabilistic shaping method for multi-level coding (MLC) is presented, where the transmitted symbols are forced to have a shaped non-uniform distribution. It is shown that shaping only a single bit-level suffices to compensate for most…
We prove a lemma which allows one to extend results about the additivity of the minimal output entropy from highly symmetric channels to a much larger class. A similar result holds for the maximal output $p$-norm. Examples are given showing…
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…
In practice, images can contain different amounts of noise for different color channels, which is not acknowledged by existing super-resolution approaches. In this paper, we propose to super-resolve noisy color images by considering the…
A pure-loss bosonic channel is a simple model for communication over free-space or fiber-optic links. More generally, phase-insensitive bosonic channels model other kinds of noise, such as thermalizing or amplifying processes. Recent work…
It is shown that given two copies of a q-ary input channel $W$, where q is prime, it is possible to create two channels $W^-$ and $W^+$ whose symmetric capacities satisfy $I(W^-)\le I(W)\le I(W^+)$, where the inequalities are strict except…
We consider the capacity of an energy harvesting communication channel with a finite-sized battery. As an abstraction of this problem, we consider a system where energy arrives at the encoder in multiples of a fixed quantity, and the…
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…
Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect…
In this article we introduce two new estimates of the normalizing constant (or marginal likelihood) for partially observed diffusion (POD) processes, with discrete observations. One estimate is biased but non-negative and the other is…
The sum capacity of a class of layered erasure one-sided interference channels is developed under the assumption of no channel state information at the transmitters. Outer bounds are presented for this model and are shown to be tight for…