English
Related papers

Related papers: The Zero-Error Feedback Capacity of State-Dependen…

200 papers

Channel state feedback plays an important role to the improvement of link performance in current wireless communication systems, and even more in the next generation. The feedback information, however, consumes the uplink bandwidth and thus…

Information Theory · Computer Science 2017-05-17 Chunbo Luo

Multiple transmit antennas in a downlink channel can provide tremendous capacity (i.e. multiplexing) gains, even when receivers have only single antennas. However, receiver and transmitter channel state information is generally required. In…

Information Theory · Computer Science 2011-11-09 Nihar Jindal

We study the hybrid classical-quantum version of the channel coding problem for the famous Gel'fand-Pinsker channel. In the classical setting for this channel the conditional distribution of the channel output given the channel input is a…

Information Theory · Computer Science 2015-12-15 Naqueeb Ahmad Warsi , Justin Coon

The zero-error capacity of a classical channel is expressed in terms of the independence number of some graph and its tensor powers. This quantity is hard to compute even for small graphs such as the cycle of length seven, so upper bounds…

Quantum Physics · Physics 2015-05-18 Salman Beigi

Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are…

Information Theory · Computer Science 2016-09-08 Cheuk Ting Li , Abbas El Gamal

Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be…

Quantum Physics · Physics 2009-02-20 Graeme Smith , Jon Yard

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

In digital systems such as fiber optical communications, the ratio between probability of errors of type $1\to 0$ and $0 \to 1$ can be large. Practically, one can assume that only one type of error can occur. These errors arecalled…

Information Theory · Computer Science 2020-04-29 Christian Deppe , Vladimir Lebedev , Georg Maringer

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

We derive various error exponents for communication channels with random states, which are available non-causally at the encoder only. For both the finite-alphabet Gel'fand-Pinsker channel and its Gaussian counterpart, the dirty-paper…

Information Theory · Computer Science 2022-05-17 Ran Tamir , Neri Merhav

The listsize capacity of a discrete memoryless channel is the largest transmission rate for which the expectation---or, more generally, the $\rho$-th moment---of the number of messages that could have produced the output of the channel…

Information Theory · Computer Science 2014-10-16 Christoph Bunte , Amos Lapidoth

We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new…

Information Theory · Computer Science 2009-10-06 Himanshu Tyagi , Prakash Narayan

We begin a systematic study of the problem of the zero--error capacity of noisy binary channels with memory and solve some of the non--trivial cases.

Combinatorics · Mathematics 2016-02-22 Gérard Cohen , Emanuela Fachini , János Körner

We consider the problem of communicating the state of a dynamical system via a Shannon Gaussian channel. The receiver, which acts as both a decoder and estimator, observes the noisy measurement of the channel output and makes an optimal…

Information Theory · Computer Science 2015-06-02 Ather Gattami

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We first propose two coding schemes for the discrete…

Information Theory · Computer Science 2015-03-19 Lili Zhang , Jinhua Jiang , Shuguang Cui

We consider the feedback capacity of a MIMO channel whose channel output is given by a linear state-space model driven by the channel inputs and a Gaussian process. The generality of our state-space model subsumes all previous studied…

Information Theory · Computer Science 2022-07-22 Oron Sabag , Victoria Kostina , Babak Hassibi

Millimeter-wave (mmWave) communication is one of the key enablers for 5G systems as it provides larger system bandwidth and the possibility of packing numerous antennas in a small form factor for highly directional communication. In order…

Information Theory · Computer Science 2022-11-17 Siyao Li , Giuseppe Caire

The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. Traditional information-theoretic analysis uses `waterfall'…

Information Theory · Computer Science 2008-01-03 Anant Sahai , Pulkit Grover

An upper bound on the feedback capacity of unifilar finite-state channels (FSCs) is derived. A new technique, called the $Q$-contexts, is based on a construction of a directed graph that is used to quantize recursively the receiver's output…

Information Theory · Computer Science 2016-04-08 Oron Sabag , Haim H. Permuter , Henry D. Pfister
‹ Prev 1 3 4 5 6 7 10 Next ›