English
Related papers

Related papers: The Sphere Packing Bound for DSPCs with Feedback a…

200 papers

The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…

Statistical Mechanics · Physics 2009-11-13 A. Scardicchio , F. H. Stillinger , S. Torquato

In this paper, we investigate the capacity of finite-state channels (FSCs) in presence of delayed feedback. We show that the capacity of a FSC with delayed feedback can be computed as that of a new FSC with instantaneous feedback and an…

Information Theory · Computer Science 2024-06-25 Bashar Huleihel , Oron Sabag , Haim H. Permuter , Victoria Kostina

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

Computational Geometry · Computer Science 2015-03-30 Milos Tatarevic

Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…

Soft Condensed Matter · Physics 2016-05-23 Miranda C. Holmes-Cerfon

This is the eighth and final paper in a series 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…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

We study natural examples of binary channels with synchronization errors. These include the duplication channel, which independently outputs a given bit once or twice, and geometric channels that repeat a given bit according to a geometric…

Information Theory · Computer Science 2018-07-19 Mahdi Cheraghchi , João Ribeiro

In this paper, we study a quantized feedback scheme to maximize the goodput of a finite blocklength communication scenario over a quasi-static fading channel. It is assumed that the receiver has perfect channel state information (CSI) and…

Information Theory · Computer Science 2022-07-04 Hasan Basri Celebi , Mikael Skoglund

An explicit output-feedback boundary feedback law is introduced that stabilizes an unstable linear constant-coefficient reaction-diffusion equation on an $n$-ball (which in 2-D reduces to a disk and in 3-D reduces to a sphere) using only…

Optimization and Control · Mathematics 2015-11-23 Rafael Vazquez , Miroslav Krstic

This paper studies whether solutions of a class of nonlinear feedback systems remain bounded over time. The systems we consider arise naturally in synthetic biology, where the antithetic feedback controller regulates a biological process…

Optimization and Control · Mathematics 2026-05-01 Moh Kamalul Wafi , Arthur C. B. de Oliveira , Eduardo D. Sontag

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

We consider finite state channels where the state of the channel is its previous output. We refer to these as POST (Previous Output is the STate) channels. We first focus on POST($\alpha$) channels. These channels have binary inputs and…

Information Theory · Computer Science 2013-09-24 Haim H. Permuter , Himanshu Asnani , Tsachy Weissman

We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive schemes, under a zero probability of error criterion. We derive single-letter inner and outer bounds for the zero-error capacity region,…

Information Theory · Computer Science 2021-09-13 Yujie Gu , Ofer Shayevitz

Accurate quantification of local packing density and mixing in simulations of particulate systems is essential for many industrial applications. Traditional methods which simply count the number of particle centres within a given volume of…

Soft Condensed Matter · Physics 2025-09-22 Freddie J. Barter , Christopher R. K. Windows-Yule

We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…

Soft Condensed Matter · Physics 2015-06-04 A. Mughal , H. K. Chan , D. Weaire , S. Hutzler

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

Combinatorics · Mathematics 2026-05-28 Domonkos Czifra , Ákos Dúcz , Máté Matolcsi , Dániel Varga , Pál Zsámboki

A new systematic approach to the construction of approximate solutions to a class of nonlinear singularly perturbed feedback control systems using the boundary layer functions especially with regard to the possible occurrence of the…

Optimization and Control · Mathematics 2017-09-07 Robert Vrabel

In this paper, a new problem of transmitting information over the adversarial insertion-deletion channel with feedback is introduced. Suppose that the encoder transmits $n$ binary symbols one-by-one over a channel, in which some symbols can…

Information Theory · Computer Science 2022-01-12 Georg Maringer , Nikita Polyanskii , Ilya Vorobyev , Lorenz Welter

We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…

Quantum Physics · Physics 2019-08-07 Xin Wang , Kun Fang , Marco Tomamichel

We revisit the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

Proposed in 1954 by Gell-Mann, Goldberger, and Thirring, crossing symmetry postulates that particles are indistinguishable from anti-particles traveling back in time. Its elusive proof amounts to demonstrating that scattering matrices in…

High Energy Physics - Theory · Physics 2021-04-28 Sebastian Mizera