English
Related papers

Related papers: The Augustin Capacity and Center

200 papers

We study the computation of the Petz-Augustin mean of order $\alpha \in (0,1) \cup (1,\infty)$, defined as the minimizer of a weighted sum of $n$ Petz-R\'enyi divergences of order $\alpha$ over the set of $d$-by-$d$ quantum states, where…

Quantum Physics · Physics 2025-07-17 Chun-Neng Chu , Wei-Fu Tseng , Yen-Huan Li

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…

Information Theory · Computer Science 2013-02-28 Amir Ingber , Ram Zamir , Meir Feder

We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels the norm of the output is maximized for the output being a normalized projection. We…

Quantum Physics · Physics 2009-11-10 M. M. Wolf , J. Eisert

This work considers a binomial noise channel. The paper can be roughly divided into two parts. The first part is concerned with the properties of the capacity-achieving distribution. In particular, for the binomial channel, it is not known…

Information Theory · Computer Science 2024-01-24 Ian Zieder , Antonino Favano , Luca Barletta , Alex Dytso

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 consider a standard two-source model for uniform common randomness (UCR) generation, in which Alice and Bob observe independent and identically distributed (i.i.d.) samples of a correlated finite source and where Alice is allowed to send…

Information Theory · Computer Science 2023-05-10 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes…

Information Theory · Computer Science 2015-10-06 Shirin Saeedi Bidokhti , Gerhard Kramer

This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol…

Information Theory · Computer Science 2010-06-11 Georg Bocherer , Valdemar Cardoso da Rocha Junior , Cecilio Pimentel

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

We consider the rate-distortion function for lossy source compression, as well as the channel capacity for error correction, through the lens of distributional robustness. We assume that the distribution of the source or of the additive…

Information Theory · Computer Science 2024-05-14 Vikrant Malik , Taylan Kargin , Victoria Kostina , Babak Hassibi

This paper studies an $n$-dimensional additive Gaussian noise channel with a peak-power-constrained input. It is well known that, in this case, when $n=1$ the capacity-achieving input distribution is discrete with finitely many mass points,…

Information Theory · Computer Science 2019-11-18 Alex Dytso , Semih Yagli , H. Vincent Poor , Shlomo Shamai

In this paper, we consider nonlinear optimization problems with nonlinear equality constraints and bound constraints on the variables. For the solution of such problems, many augmented Lagrangian methods have been defined in the literature.…

Optimization and Control · Mathematics 2022-01-12 Andrea Cristofari , Gianni Di Pillo , Giampaolo Liuzzi , Stefano Lucidi

The capacity-achieving input distribution of the discrete-time, additive white Gaussian noise (AWGN) channel with an amplitude constraint is discrete and seems difficult to characterize explicitly. A dual capacity expression is used to…

Information Theory · Computer Science 2015-11-30 Andrew Thangaraj , Gerhard Kramer , Georg Bocherer

We consider the classical AWGN channel where the channel input is constrained to an amplitude constraint that stochastically varies at each channel use, independent of the message. This is an abstraction of an energy harvesting transmitter…

Information Theory · Computer Science 2012-01-24 Omur Ozel , Sennur Ulukus

The problem of computing $\alpha$-capacity for $\alpha>1$ is equivalent to that of computing the correct decoding exponent. Various algorithms for computing them have been proposed, such as Arimoto and Jitsumatsu--Oohama algorithm. In this…

Information Theory · Computer Science 2024-05-14 Akira Kamatsuka , Koki Kazama , Takahiro Yoshida

The mutual information is bounded from above by a decreasing affine function of the square of the distance between the input distribution and the set of all capacity-achieving input distributions $\Pi_{\mathcal{A}}$, on small enough…

Information Theory · Computer Science 2025-04-24 Barış Nakiboğlu , Hao-Chung Cheng

The property of the optimal signal ensembles of entanglement assisted channel capacity is studied. A relationship between entanglement assisted channel capacity and one-shot capacity of unassisted channel is obtained. The data processing…

Quantum Physics · Physics 2009-11-10 Heng Fan

Large language models improve with scale, yet feedback-based alignment still exhibits systematic deviations from intended behavior. Motivated by bounded rationality in economics and cognitive science, we view judgment as resource-limited…

Machine Learning · Computer Science 2025-09-22 Wenjun Cao

We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, that we define similarly to the Holevo capacity,…

Quantum Physics · Physics 2009-07-24 Milan Mosonyi , Nilanjana Datta

The capacity of a complex and discrete-time memoryless additive white Gaussian noise (AWGN) channel under three constraints, namely, input average power, input amplitude and output delivered power is studied. The output delivered power…

Information Theory · Computer Science 2020-04-27 Morteza Varasteh , Borzoo Rassouli , Bruno Clerckx