Related papers: The Sphere Packing Bound for DSPCs with Feedback a…
The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding) for stationary and memoryless sources on countably infinite alphabets ($\infty$-alphabets) is addressed in this paper. The main…
The packing of hard spheres (HS) of diameter $\sigma$ in a cylinder has been used to model experimental systems, such as fullerenes in nanotubes and colloidal wire assembly. Finding the densest packings of HS under this type of confinement,…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…
This paper studies a version of the counting problem in dynamical systems that is of interest, especially in conformal dynamical systems where the functions of the systems are angle preserving. Recently, M. Pollicott and M. Urba\'{n}ski…
In this paper, we study the achievable performance of dirty paper coding for the Gaussian broadcast channel (BC) with finite blocklength and we propose two different achievability bounds for this problem. We present the broadcast adaptation…
We consider the problem of communicating over a channel for which no mathematical model is specified. We present achievable rates as a function of the channel input and output sequences known a-posteriori for discrete and continuous…
We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of…
The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of…
We develop an accurate finite-time scaling analysis of the angular width of the coherent backscattering (CBS) peak for waves propagating in 3D random media. Applying this method to ultracold atoms in optical speckle potentials, we show how…
This paper describes the local density inequality approach to getting upper bounds for sphere packing densities in R^n. This approach was first suggested by L. Fejes-Toth in 1956 to prove the Kepler conjecture that the densest sphere…
We develop a unified framework that reconciles a barrier based geometric model of periodic sphere packings with a provably convergent discrete time dynamics. First, we introduce a C2 interior barrier U_nu that is compatible with a strict…
We show there exists a packing of identical spheres in $\mathbb{R}^d$ with density at least \[ (1-o(1))\frac{d \log d}{2^{d+1}}\, , \] as $d\to\infty$. This improves upon previous bounds for general $d$ by a factor of order $\log d$ and is…
This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…
We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels. The main tool we use is the tension region of a pair of random variables introduced in Prabhakaran and Prabhakaran (2014) where it was…
This is the second in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
As a key method in dealing with uncertainties, feedback has been understood fairly well in classical control theory. But for quantum control systems, the capability of measurement-based feedback control (MFC) has not been investigated…
We consider the feedback stabilization of a variable profile for an ensemble of non interacting half spins described by the Bloch equations. We propose an explicit feedback law that stabilizes asymptotically the system around a given…
We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…
We study a class of finite-state channels, known as POST channels, in which the previous channel output serves as the current state. A POST channel is deemed approximately memoryless when the state-dependent transition matrices are…