Related papers: A New Convexity Result and the Multiple Access Cha…
Widely adopted at home, business places, and hot spots, wireless ad-hoc networks are expected to provide broadband services parallel to their wired counterparts in near future. To address this need, MIMO techniques, which are capable of…
The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give single-letter identification capacity formulas for discrete…
This work considers the multiple-access multicast error-correction scenario over a packetized network with $z$ malicious edge adversaries. The network has min-cut $m$ and packets of length $\ell$, and each sink demands all information from…
Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…
The information convex allows us to look into certain information-theoretic constraints in two-dimensional topological orders. We provide a derivation of the topological contribution $\ln d_a$ to the von Neumann entropy, where $d_a$ is the…
We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…
We use symplectic techniques to obtain partial results on Mahler's conjecture about the product of the volume of a convex body and the volume of its polar. We confirm the conjecture for hyperplane sections or projections of $\ell_p$-balls…
A network where three users want to establish multiple unicasts between each other via a relay is considered. This network is called the Y-channel and resembles an elemental ingredient of future wireless networks. The sum-capacity of this…
Deterministic identification over K-input multiple-access channels with average input cost constraints is considered. The capacity region for deterministic identification is determined for an average-error criterion, where arbitrarily large…
Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…
Much of the existing work on the broadcast channel focuses only on the sending of private messages. In this work we examine the scenario where the sender also wishes to transmit common messages to subsets of receivers. For an L user…
In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…
A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…
In his paper "On the Schlafli differential equality", J. Milnor conjectured that the volume of n-dimensional hyperbolic and spherical simplices, as a function of the dihedral angles, extends continuously to the closure of the space of…
The capacity of a channel characterizes the maximum rate at which information can be transmitted through the channel asymptotically faithfully. For a channel with multiple senders and a single receiver, computing its sum capacity is…
A multiplicativity conjecture for quantum communication channels is formulated, validity of which for the values of parameter $p$ close to 1 is related to the solution of the fundamental problem of additivity of the channel capacity in…
The information carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an orthonormal basis of the state space,…
The continuity properties of the convex closure of the output entropy of infinite dimensional channels and their applications to the additivity problem are considered. The main result of this paper is the statement that the superadditivity…
For a multi-user interference channel with multi-antenna transmitters and single-antenna receivers, by restricting each receiver to a single-user detector, computing the largest achievable rate region amounts to solving a family of…
For any channel with a convex constraint set and finite Augustin capacity, existence of a unique Augustin center and associated Erven-Harremoes bound are established. Augustin-Legendre capacity, center, and radius are introduced and proved…