English
Related papers

Related papers: $(\epsilon, n)$ Fixed-Length Strong Coordination C…

200 papers

We study the performance of asymptotic and approximate consensus algorithms under harsh environmental conditions. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-06-28 Matthias Függer , Thomas Nowak , Manfred Schwarz

The emergence of 6G networks enables simultaneous near-field and far-field communications through extremely large antenna arrays and high carrier frequencies. While these regimes enhance spatial multiplexing and link capacity, their…

Signal Processing · Electrical Eng. & Systems 2025-11-13 Humera Hameed , Waqas Aman , Muhammad Mahboob Ur Rahman , Ali Arshad Nasir

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi

Accurate fading characterization and channel capacity determination are of paramount importance in both conventional and emerging communication systems. The present work addresses the nonlinearity of the propagation medium and its effects…

Information Theory · Computer Science 2016-12-30 Paschalis C. Sofotasios , Sami Muhaidat , Mikko Valkama , Mounir Ghogho , George K. Karagiannidis

This paper develops a new framework, \emph{simultaneous saturation}, designed to quantify the size of sets whose elements are simultaneously large. The framework establishes a correspondence between the magnitude of such sets and a system…

Classical Analysis and ODEs · Mathematics 2025-11-26 Melissa Tacy

Flat-fading channels that are correlated in time are considered under peak and average power constraints. For discrete-time channels, a new upper bound on the capacity per unit time is derived. A low SNR analysis of a full-scattering vector…

Information Theory · Computer Science 2007-07-13 Vignesh Sethuraman , Bruce Hajek

Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…

Information Theory · Computer Science 2016-12-28 Pierre Moulin

We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…

Information Theory · Computer Science 2026-05-22 Prachi Mishra , Sidharth Jaggi , Navin Kashyap , Michael Langberg

Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference…

Systems and Control · Computer Science 2016-05-13 Matthias Lorenzen , Fabrizio Dabbene , Roberto Tempo , Frank Allgöwer

Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated…

Optimization and Control · Mathematics 2024-03-26 Maksim Velikanov , Dmitry Yarotsky

We present a security analysis against collective attacks for the recently proposed time-energy entanglement-based quantum key distribution protocol, given the practical constraints of single photon detector efficiency, channel loss, and…

Quantum Physics · Physics 2015-02-24 Catherine Lee , Jacob Mower , Zheshen Zhang , Jeffrey H. Shapiro , Dirk Englund

We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding a variable-length uniform random number, and the asymptotically minimum average length rate of the…

Information Theory · Computer Science 2017-01-31 Hideki Yagi , Te Sun Han

We propose a new upper bound for the eavesdropper's information in the direct and reverse reconciliated coherent states quantum key distribution protocols with heterodyne detection. This bound is derived by maximizing the leaked information…

Quantum Physics · Physics 2009-02-17 Jerome Lodewyck , Philippe Grangier

We study multiple scattering off nuclei in the closure approximation. Instead of reducing the dynamics to one particle potential scattering, the scattering amplitude for fixed target configurations is averaged over the target groundstate…

Nuclear Theory · Physics 2015-06-26 S. Lenz , D. Stoll

The posterior distribution of the number of components k in a finite mixture satisfies a set of inequality constraints. The result holds irrespective of the parametric form of the mixture components and under assumptions on the prior…

Statistics Theory · Mathematics 2007-06-13 Agostino Nobile

Reliable distribution of quantum entanglement over long distances is a central challenge in quantum information science, fundamentally limited by decoherence in noisy communication channels. In this work, we investigate the asymptotic…

Quantum Physics · Physics 2026-05-25 Piotr Masajada , Aby Philip , Alexander Streltsov

The study of free-space quantum communications requires tools from quantum information theory, optics and turbulence theory. Here we combine these tools to bound the ultimate rates for key and entanglement distribution through a free-space…

Quantum Physics · Physics 2021-05-10 Stefano Pirandola

A fast convergence in a fixed-time of solutions of nonlinear dynamical systems, for which special requirements are satisfied on the derivative of a quadratic function calculated along the solutions of the system, is proposed. The conditions…

Systems and Control · Electrical Eng. & Systems 2025-12-24 Igor B. Furtat

This paper considers the problem of variable-length coding over a discrete memoryless channel (DMC) with noiseless feedback. The paper provides a stochastic control view of the problem whose solution is analyzed via a newly proposed…

Information Theory · Computer Science 2016-11-18 Mohammad Naghshvar , Tara Javidi , Michèle Wigger