中文
相关论文

相关论文: The Augustin Capacity and Center

200 篇论文

Information Causality is a physical principle which states that the amount of randomly accessible data over a classical communication channel cannot exceed its capacity, even if the sender and the receiver have access to a source of…

量子物理 · 物理学 2021-06-09 Nikolai Miklin , Marcin Pawłowski

In the decades following Shannon's work, the quest to design codes for the additive white Gaussian noise (AWGN) channel led to the development of a rich theory, revealing a number of beautiful connections between information theory and…

信息论 · 计算机科学 2017-12-21 Laura Luzzi , Roope Vehkalahti

Almost all modern communication systems rely on electromagnetic fields as a means of information transmission, and finding the capacities of these systems is a problem of significant practical importance. The Additive White Gaussian Noise…

量子物理 · 物理学 2013-02-05 Robert Koenig , Graeme Smith

We present a family of relatively simple and unified lower bounds on the capacity of the Gaussian channel under a set of pointwise additive input constraints. Specifically, the admissible channel input vectors $\bx = (x_1, \ldots, x_n)$…

信息论 · 计算机科学 2025-10-07 Neri Merhav , Shlomo Shamai

We consider the full shift $T:\Omega\to\Omega$ where $\Omega=A^{\mathbb N}$, $A$ being a finite alphabet. For a class of potentials which contains in particular potentials $\phi$ with variation decreasing like $O(n^{-\alpha})$ for some…

动力系统 · 数学 2020-02-19 J. -R. Chazottes , J. Moles , E. Ugalde

We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration…

概率论 · 数学 2015-12-03 Akshay Balsubramani

Capacity analysis for channels with side information at the receiver has been an active area of interest. This problem is well investigated for the case of finite alphabet channels. However, the results are not easily generalizable to the…

信息论 · 计算机科学 2016-11-18 Majid Fozunbal , Steven W. McLaughlin , Ronald W. Schafer

We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the…

量子物理 · 物理学 2007-05-23 Peter W. Shor

Necessary optimality conditions in Lagrangian form and the sequential minimization framework are extended to mixed-integer nonlinear optimization, without any convexity assumptions. Building upon a recently developed notion of local…

最优化与控制 · 数学 2026-04-10 Alberto De Marchi

Nowadays, online learning is an appealing learning paradigm, which is of great interest in practice due to the recent emergence of large scale applications such as online advertising placement and online web ranking. Standard online…

机器学习 · 计算机科学 2019-11-27 Biyi Fang , Diego Klabjan

In this work, we provide some novel results that establish both the existence of Henig global proper efficient points and their density in the efficient set for vector optimization problems in arbitrary normed spaces. Our results do not…

最优化与控制 · 数学 2024-11-01 Fernando García-Castaño , Miguel Ángel Melguizo-Padial

We introduce a new form of Lagrangian and propose a simple first-order algorithm for nonconvex optimization with nonlinear equality constraints. We show the algorithm generates bounded dual iterates, and establish the convergence to KKT…

最优化与控制 · 数学 2023-05-10 Jong Gwang Kim

The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this article we define randomness distribution capacities of quantum channels assisted by forward,…

量子物理 · 物理学 2018-05-22 Raul Garcia-Patron , William Matthews , Andreas Winter

Babai's conjecture states that, for any finite simple non-abelian group $G$, the diameter of $G$ is bounded by $(\log|G|)^{C}$ for some absolute constant $C$. We prove that, for any untwisted classical group $G$ of rank $r$ defined over a…

群论 · 数学 2024-12-16 Jitendra Bajpai , Daniele Dona , Harald Andrés Helfgott

The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give single-letter identification capacity formulas for discrete…

信息论 · 计算机科学 2021-12-03 Johannes Rosenberger , Uzi Pereg , Christian Deppe

We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…

群论 · 数学 2026-05-01 Narutaka Ozawa

The Katz-Sarnak Density Conjecture states that zeros of families of $L$-functions are well-modeled by eigenvalues of random matrix ensembles. For suitably restricted test functions, this correspondence yields upper bounds for the families'…

数论 · 数学 2022-08-02 Jiahui Li , Steven J. Miller

We give a new criterion for a classical gas with a repulsive pair potential to exhibit uniqueness of the infinite volume Gibbs measure and analyticity of the pressure. Our improvement on the bound for analyticity is by a factor $e^2$ over…

数学物理 · 物理学 2022-11-01 Marcus Michelen , Will Perkins

We consider the possibility that some supersymmetric gauge theories which are not asymptotically free can be governed by ultraviolet-stable fixed points. If this scenario can be realized, gaugino masses will exhibit power-law running with…

高能物理 - 唯象学 · 物理学 2014-11-17 Stephen P. Martin , James D. Wells

We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the sender and the receiver. The two…

量子物理 · 物理学 2020-01-10 Kun Wang , Masahito Hayashi
‹ 上一页 1 8 9 10 下一页 ›