English
Related papers

Related papers: Shannon Bounds for Quadratic Rate-Distortion Probl…

200 papers

We provide a novel upper-bound on Witsenhausen's rate, the rate required in the zero-error analogue of the Slepian-Wolf problem; our bound is given in terms of a new information-theoretic functional defined on a certain graph. We then use…

Information Theory · Computer Science 2010-01-25 Benjamin G. Kelly , Aaron B. Wagner

Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication…

Quantum Physics · Physics 2021-05-17 Sristy Agrawal , Rajashik Tarafder , Graeme Smith , Arup Roy , Manik Banik

In a recent paper, Gaunt 2020 extended Stein's method to limit distributions that can be represented as a function $g:\mathbb{R}^d\rightarrow\mathbb{R}$ of a centered multivariate normal random vector $\Sigma^{1/2}\mathbf{Z}$ with…

Probability · Mathematics 2022-09-21 Robert E. Gaunt , Heather Sutcliffe

In this paper we characterize sharp time-data tradeoffs for optimization problems used for solving linear inverse problems. We focus on the minimization of a least-squares objective subject to a constraint defined as the sub-level set of a…

Information Theory · Computer Science 2016-01-06 Samet Oymak , Benjamin Recht , Mahdi Soltanolkotabi

We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliably transport the output of two correlated information sources…

Information Theory · Computer Science 2008-05-28 R. Timo , A. Grant , T. Chan , G. Kramer

We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth's…

Number Theory · Mathematics 2024-09-26 Bryce Joseph Orloski , Naser Talebizadeh Sardari , Alexander Smith

In this paper we present a reduced basis method which yields structure-preservation and a tight a posteriori error bound for the simulation of the damped wave equations on networks. The error bound is based on the exponential decay of the…

Numerical Analysis · Mathematics 2022-04-12 Nadine Stahl , Björn Liljegren-Sailer , Nicole Marheineke

In this paper, some general properties of Shannon information measures are investigated over sets of probability distributions with restricted marginals. Certain optimization problems associated with these functionals are shown to be…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Ivan Stanojević , Vojin Šenk

We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a…

Information Theory · Computer Science 2015-12-21 Ramji Venkataramanan , Antony Joseph , Sekhar Tatikonda

In this paper, we use tools from rate-distortion theory to establish new upper bounds on the generalization error of statistical distributed learning algorithms. Specifically, there are $K$ clients whose individually chosen models are…

Machine Learning · Statistics 2022-11-23 Milad Sefidgaran , Romain Chor , Abdellatif Zaidi

The paper deals with establishing bounds for Eisenstein series on congruence quotients of the upper half plane, with control of both the spectral parameter and the level. The key observation in this work is that we exploit better the…

Number Theory · Mathematics 2017-01-02 Bingrong Huang , Zhao Xu

In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a…

Information Theory · Computer Science 2014-06-05 Adel Zahedi , Jan Ostergaard , Soren Holdt Jensen , Patrick Naylor , Soren Bech

Since Shannon's foundational work, rate-distortion theory has defined the fundamental limits of lossy compression. Classical results, derived for memoryless and stationary ergodic sources in the asymptotic regime, have shaped both transform…

Information Theory · Computer Science 2026-03-11 Sujata Sinha , Vishwas Rao , Robert Underwood , David Lenz , Sheng Di , Franck Cappello , Lingjia Liu

This paper derives lower bounds for the mean square errors of parameter estimators in the case of Poisson distributed data subjected to multiple abrupt changes. Since both change locations (discrete parameters) and parameters of the Poisson…

Information Theory · Computer Science 2016-10-31 Lucien Bacharach , Mohammed Nabil El Korso , Alexandre Renaux , Jean-Yves Tourneret

We propose a data-driven approach to explicitly learn the progressive encoding of a continuous source, which is successively decoded with increasing levels of quality and with the aid of correlated side information. This setup refers to the…

Machine Learning · Computer Science 2023-11-07 Boris Joukovsky , Brent De Weerdt , Nikos Deligiannis

We consider transmission of a continuous amplitude source over an L-block Rayleigh fading $M_t \times M_r$ MIMO channel when the channel state information is only available at the receiver. Since the channel is not ergodic, Shannon's…

Information Theory · Computer Science 2007-11-09 Deniz Gunduz , Elza Erkip

In this paper, we first provide three general norm inequalities, which are used to give new uncertainty relations of any finite observables and quantum channels via metric-adjusted skew information. The results are applicable to its special…

Quantum Physics · Physics 2023-04-27 Hui Li , Ting Gao , Fengli Yan

In this article new bounds on weighted p-norms of ambiguity functions and Wigner functions are derived. Such norms occur frequently in several areas of physics and engineering. In pulse optimization for Weyl--Heisenberg signaling in…

Information Theory · Computer Science 2016-11-17 Peter Jung

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations,…

Information Theory · Computer Science 2017-03-02 Gil Katz , Pablo Piantanida , Mérouane Debbah

The multi-terminal rate-distortion problem has been studied extensively. Notably, among these, Tung and Housewright have provided the best known inner and outer bounds for the rate region under certain distortion constraints. In this paper,…

Information Theory · Computer Science 2007-07-16 W. Kang , S. Ulukus