English
Related papers

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

200 papers

We study a class of self-adjoint operators defined on the direct sum of two Hilbert spaces: a finite dimensional one called sometimes a ``small subsystem'' and an infinite dimensional one -- a ``reservoir''. The operator, which we call a…

Mathematical Physics · Physics 2009-11-11 Jan Derezinski , Wojciech De Roeck

In this paper, we derive upper and lower bounds as well as a simple closed-form approximation for the capacity of the continuous-time, bandlimited, additive white Gaussian noise channel in a three-dimensional free-space electromagnetic…

Information Theory · Computer Science 2017-02-27 Richard J. Barton

In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the…

Information Theory · Computer Science 2018-06-28 Austin Collins , Yury Polyanskiy

In Federated Learning (FL) paradigm, a parameter server (PS) concurrently communicates with distributed participating clients for model collection, update aggregation, and model distribution over multiple rounds, without touching private…

Machine Learning · Computer Science 2024-02-07 Xiaoxin Su , Yipeng Zhou , Laizhong Cui , John C. S. Lui , Jiangchuan Liu

In this paper, we show a series of abstract results on fixed point regularity with respect to a parameter. They are based on a Taylor development taking into account a loss of regularity phenomenon, typically occurring for composition…

Dynamical Systems · Mathematics 2018-04-04 Julien Sedro

This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output (MIMO) fading channels, with and without channel state information (CSI) at the transmitter…

Information Theory · Computer Science 2014-04-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

We consider the exact channel synthesis problem. This problem concerns the determination of the minimum amount of information required to create exact correlation remotely when there is a certain rate of randomness shared by two terminals.…

Information Theory · Computer Science 2019-09-27 Lei Yu , Vincent Y. F. Tan

In this paper, we investigate the problem of distributionally robust source coding, i.e., source coding under uncertainty in the source distribution, discussing both the coding and computational aspects of the problem. We propose two…

Information Theory · Computer Science 2025-07-24 Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

The motivation for the development of a local finite density theory is discussed. One of the problems related to an instability in the baryon number fluctuation of the chiral symmetry breaking phase of the quark system in the local theory…

High Energy Physics - Phenomenology · Physics 2009-09-25 S. Ying

We investigate the problem of generating common randomness (CR) from finite compound sources aided by unidirectional communication over rate-limited perfect channels. The two communicating parties, often referred to as terminals, observe…

Information Theory · Computer Science 2024-01-26 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

The aim of this work is to provide further insight into the qualitative behavior of mechanical systems that are well described by Lennard-Jones type interactions on an atomistic scale. By means of $\Gamma$-convergence techniques, we study…

Analysis of PDEs · Mathematics 2017-06-09 Mathias Schäffner , Anja Schlömerkemper

Basing on recently developed convex programming framework in the paper [arXiv:2204.10626], we provide a proof for a long-standing conjecture on optimality of Gaussian encondings for the ultimate communication rate of generalized heterodyne…

Quantum Physics · Physics 2023-07-25 A. S. Holevo , S. N. Filippov

The paper considers the problem of calculating the distribution function of a strictly stable law at $x\to\infty$. To solve this problem, an expansion of the distribution function in a power series was obtained, and an estimate of the…

Statistics Theory · Mathematics 2023-03-23 Viacheslav V. Saenko

In this paper, we examine the performance of the decode-and-forward (DF) relaying protocols with finite blocklength (FB). We provide the overall outage probability of three distinct DF relaying protocols, where the channels are assumed to…

Information Theory · Computer Science 2017-06-22 Parisa Nouri , Hirley Alves , Matti Latva-aho

We present an analytical description of the large-amplitude stationary oscillations of the finite discrete system of harmonically-coupled pendulums without any restrictions to their amplitudes (excluding a vicinity of $\pi$). Although this…

Classical Physics · Physics 2016-04-11 Valeri V. Smirnov , Leonid I. Manevitch

The method for the recursive calculation of the effective potential is applied successfully in case of weak coupling limit (g tend to zero) to a multidimensional complex cubic potential. In strong-coupling limit (g tend to infinity), the…

Mathematical Physics · Physics 2008-11-26 S. -A. Yahiaoui , O. Cherroud , M. Bentaiba

In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize the secrecy capacity with a rate-limited local source of…

Information Theory · Computer Science 2012-02-27 Matthieu R. Bloch , Joerg Kliewer

We review the results of large scale simulations of noncompact quenched $QED$ which use spectrum and Equation of State calculations to determine the theory's phase diagram, critical indices, and continuum limit. The resulting anomalous…

High Energy Physics - Lattice · Physics 2009-10-22 Mp Lombardo , J. B. Kogut , A. Kocic , K. C. Wang

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…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas
‹ Prev 1 8 9 10 Next ›