English
Related papers

Related papers: Capacity Bounds for Dirty Paper with Exponential D…

200 papers

The discrete-time Wiener phase noise channel with an integrate-and-dump multi-sample receiver is studied. A novel outer bound on the capacity with an average input power constraint is derived as a function of the oversampling factor. This…

Information Theory · Computer Science 2017-05-24 Luca Barletta , Stefano Rini

We investigate the Peak-Power Limited (PPL) Additive White Gaussian Noise (AWGN) channels in which the signal is band-limited, and its instantaneous power cannot exceed the power P. This model is relevant to many communication systems;…

Information Theory · Computer Science 2024-12-10 Michael Peleg , Shlomo Shamai

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…

Quantum Physics · Physics 2013-02-05 Robert Koenig , Graeme Smith

Communication rates over quantum channels can be boosted by entanglement, via superadditivity phenomena or entanglement assistance. Superadditivity refers to the capacity improvement from entangling inputs across multiple channel uses.…

Quantum Physics · Physics 2022-03-14 Haowei Shi , Quntao Zhuang

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…

Information Theory · Computer Science 2016-11-18 Xiaohu Shang , Gerhard Kramer , Biao Chen

The capacity of the discrete-time channel affected by both additive Gaussian noise and Wiener phase noise is studied. Novel inner and outer bounds are presented, which differ of at most $6.65$ bits per channel use for all channel…

Information Theory · Computer Science 2017-01-19 Luca Barletta , Stefano Rini

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

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang

We consider a quantum bosonic channel that couples the input mode via a beam splitter or two-mode squeezer to an environmental mode that is prepared in an arbitrary state. We investigate the classical capacity of this channel, which we call…

Quantum Physics · Physics 2026-01-23 Zacharie Van Herstraeten , Saikat Guha , Nicolas J. Cerf

This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…

Information Theory · Computer Science 2015-03-19 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

We address the problem of universal communications over an unknown channel with an instantaneous noiseless feedback, and show how rates corresponding to the empirical behavior of the channel can be attained, although no rate can be…

Information Theory · Computer Science 2008-09-01 Ofer Shayevitz , Meir Feder

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…

Information Theory · Computer Science 2007-10-22 I. Maric , A. Goldsmith , G. Kramer , S. Shamai

$M$-ary signal transmission over AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter is considered. Shannon's theorem for channels with side information at…

Information Theory · Computer Science 2007-07-13 Hamid Farmanbar , Amir K. Khandani

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

A continuous-time Wiener phase noise channel with an integrate-and-dump multi-sample receiver is studied. A lower bound to the capacity with an average input power constraint is derived, and a high signal-to-noise ratio (SNR) analysis is…

Information Theory · Computer Science 2015-03-12 Luca Barletta , Gerhard Kramer

The capacity of multiple-input multiple-output additive white Gaussian noise channels is investigated under peak amplitude constraints on the norm of the input vector. New insights on the capacity-achieving input distribution are presented.…

Information Theory · Computer Science 2021-05-06 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…

Information Theory · Computer Science 2016-11-17 Andrew Thangaraj

In this work we study the capacity of interference-limited channels with memory. These channels model non-orthogonal communications scenarios, such as the non-orthogonal multiple access (NOMA) scenario and underlay cognitive communications,…

Information Theory · Computer Science 2023-06-02 Ron Dabora , Emeka Abakasanga

We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…

Information Theory · Computer Science 2022-02-18 Moritz Wiese , Wafa Labidi , Christian Deppe , Holger Boche