English
Related papers

Related papers: Capacity Definitions for General Channels with Rec…

200 papers

A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. In…

Information Theory · Computer Science 2015-01-06 Lóránt Farkas , Tamás Kói

Optimization methods aimed at estimating the capacities of a general Gaussian channel are developed. Specifically evaluation of classical capacity as maximum of the Holevo information is pursued over all possible Gaussian encodings for the…

Quantum Physics · Physics 2012-09-12 Oleg V. Pilyavets , Cosmo Lupo , Stefano Mancini

Shannon theory models communication as the reliable transfer of symbol sequences, with performance governed by capacity and rate-distortion limits. When both endpoints possess strong predictors -- as in modern large language models and…

Information Theory · Computer Science 2026-02-12 Ozgur Ercetin , Mohaned Chraiti

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

An upper bound on the capacity of a cascade of nonlinear and noisy channels is presented. The cascade mimics the split-step Fourier method for computing waveform propagation governed by the stochastic generalized nonlinear Schroedinger…

Information Theory · Computer Science 2015-04-24 Gerhard Kramer , Mansoor I. Yousefi , Frank R. Kschischang

In this paper, we make use of channel symmetry properties to determine the capacity region of three types of two-way networks: (a) two-user memoryless two-way channels (TWCs), (b) two-user TWCs with memory, and (c) three-user…

Information Theory · Computer Science 2019-10-02 Jian-Jia Weng , Lin Song , Fady Alajaji , Tamás Linder

We review how Shannon's classical notion of capacity is not enough to characterize a noisy communication channel if the channel is intended to be used as part of a feedback loop to stabilize an unstable scalar linear system. While classical…

Information Theory · Computer Science 2007-07-13 Anant Sahai , Sanjoy Mitter

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…

Information Theory · Computer Science 2013-03-01 Venkatesan Guruswami , Adam Smith

A new stochastic order between two fading distributions is introduced. A fading channel dominates another in the ergodic capacity ordering sense, if the Shannon transform of the first is greater than that of the second at all values of…

Information Theory · Computer Science 2016-11-15 Adithya Rajan , Cihan Tepedelenlioglu

As conventional communication systems based on classic information theory have closely approached the limits of Shannon channel capacity, semantic communication has been recognized as a key enabling technology for the further improvement of…

Information Theory · Computer Science 2023-06-06 Jiancheng Tang , Qianqian Yang , Zhaoyang Zhang

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

Quantum Physics · Physics 2008-08-28 Graeme Smith , John A. Smolin , Andreas Winter

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum achievable expected rate for coding over a finite number of coherent blocks represents a fundamental measure of the…

Information Theory · Computer Science 2013-01-25 Jae Won Yoo , Tie Liu , Shlomo Shamai , Chao Tian

This paper investigates the capacity region of the optical intensity broadcast channels (OI-BCs), where the input is subject to a peak-intensity constraint, an average-intensity constraint, or both. By leveraging the decomposition results…

Information Theory · Computer Science 2023-03-02 Sufang Yang , Longguang Li , Jintao Wang

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

Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estimate of the channel is available that differs from the true…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Gerald Matz , Pierre Duhamel

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

Information Theory · Computer Science 2012-08-21 Stefano Rini , Carolin Huppert

Shannon theory is revisited to show that ergodicity is an indispensable element of channel capacity. The generalized channel capacity $C=\sup_{\bm{X}}\underline{I}(\bm{X}; \bm{Y})$ is checked with a negative conclusion and the popular…

Information Theory · Computer Science 2024-10-03 Xuezhi Yang

The secrecy capacity problems over the general arbitrarily varying wiretap channel (AVWC), with respect to the maximal decoding error probability and strong secrecy criterion, are considered, where the channel state sequence may be known or…

Information Theory · Computer Science 2017-12-05 Dan He , Yuan Luo
‹ Prev 1 3 4 5 6 7 10 Next ›