Related papers: A note on outer bounds for broadcast channel
Provable lower bounds are presented for the information rate I(X; X+S+N) where X is the symbol drawn independently and uniformly from a finite-size alphabet, S is a discrete-valued random variable (RV) and N is a Gaussian RV. It is well…
We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we…
The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…
In this paper we study the upper bound of wavefront sets of irreducible admissible representations of connected reductive groups defined over non-Archimedean local fields of characteristic zero. We formulate a new conjecture on the upper…
We present a case for the use of codes possessing algebraic closure properties - coset codes - in developing coding techniques and characterizing achievable rate regions for generic multi-terminal channels. In particular, we consider three…
This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…
The binary adder is a two-user multiple access channel whose inputs are binary and whose output is the real sum of the inputs. While the Shannon capacity region of this channel is well known, little is known regarding its zero-error…
For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This finding completes the characterization of the third-order…
The problem of characterizing the capacity region for Gaussian broadcast channels with receiver message side information appears difficult and remains open for N >= 3 receivers. This paper proposes a joint network and Gelfand-Pinsker coding…
A smooth function of the second moments of $N$ continuous variables gives rise to an uncertainty relation if it is bounded from below. We present a method to systematically derive such bounds by generalizing an approach applied previously…
In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…
This paper considers the three-receiver AWGN broadcast channel where the receivers (i) have private-message requests and (ii) know some of the messages requested by other receivers as side information. For this setup, all possible side…
It is important in many applications to be able to extend the (outer) unit normal vector field from a hypersurface to its neighborhood in such a way that the result is a unit gradient field. The aim of the paper is to provide an elementary…
In a matter-filled spacetime, perhaps with positive cosmological constant, a stable marginally outer trapped 2-sphere must satisfy a certain area inequality. Namely, as discussed in the paper, its area must be bounded above by $4\pi/c$,…
An upper bound on the capacity of a cascade of nonlinear and noisy channels is presented. The cascade mimics the split-step Fourier method for computing waveform propagation governed by the stochastic generalized nonlinear Schroedinger…
We consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally…
This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…
We study the capacity region of the two-user Binary Fading (or Erasure) Interference Channel where the transmitters have no knowledge of the channel state information. We develop new inner-bounds and outer-bounds for this problem. We…
We present results from a new technique which allows extraction of gravitational radiation information from a generic three-dimensional numerical relativity code and provides stable outer boundary conditions. In our approach we match the…
For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…