English
Related papers

Related papers: Concavity of Mutual Information Rate for Input-Res…

200 papers

A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial…

Information Theory · Computer Science 2010-12-10 Giacomo Como , Serdar Yüksel

Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this Paper, we study…

Quantum Physics · Physics 2015-06-26 A. Fahmi , M. Golshani

We calculate the quantum capacity of an amplitude-damping channel with time correlated Markov noise, for two channel uses. Our results show that memory of the channel increases it's ability to transmit quantum information significantly. We…

Quantum Physics · Physics 2017-07-03 Rabia Jahangir , Nigum Arshed , A. H. Toor

Shannon's mutual information of a random multiple antenna and multipath channel is studied in the general case where the channel impulse response is an ergodic and stationary process which is assumed to be available at the receiver. From…

Information Theory · Computer Science 2019-05-09 Walid Hachem , Adrien Hardy , Shlomo Shamai

We derive an approximate expression for mutual information in a broad class of discrete-time stationary channels with continuous input, under the constraint of vanishing input amplitude or power. The approximation describes the input by its…

Information Theory · Computer Science 2015-05-19 Lubomir Kostal

We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and…

Probability · Mathematics 2009-08-10 Guangyue Han , Brian Marcus

We consider a new formulation of a class of synchronization error channels and derive analytical bounds and numerical estimates for the capacity of these channels. For the binary channel with only deletions, we obtain an expression for the…

Information Theory · Computer Science 2016-11-17 Aravind R. Iyengar , Paul H. Siegel , Jack K. Wolf

This paper quantifies the intuitive observation that adding noise reduces available information by means of non-linear strong data processing inequalities. Consider the random variables $W\to X\to Y$ forming a Markov chain, where $Y=X+Z$…

Information Theory · Computer Science 2017-11-21 Flavio P. Calmon , Yury Polyanskiy , Yihong Wu

A single-letter characterization is provided for the capacity region of finite-state multiple access channels. The channel state is a Markov process, the transmitters have access to delayed state information, and channel state information…

Information Theory · Computer Science 2015-03-17 Uria Basher , Avihay Shirazi , Haim Permuter

We consider a unit memory channel, called Binary State Symmetric Channel (BSSC), in which the channel state is the modulo2 addition of the current channel input and the previous channel output. We derive closed form expressions for the…

Information Theory · Computer Science 2015-07-03 Christos K. Kourtellaris , Charalambos D. Charalambous

Particularly motivated by DNA storage channels, we consider channels with synchronization errors modeled as insertions and deletions, along with substitutions. We focus on the case where the synchronization error process has memory and…

Information Theory · Computer Science 2026-04-14 Ruslan Morozov , Tolga M. Duman

This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes…

Information Theory · Computer Science 2013-04-19 Roberto W. Nóbrega , Danilo Silva , Bartolomeu F. Uchôa-Filho

We consider the problem of transmitting classical information over a time-invariant channel with memory. A popular class of time-invariant channels with memory are finite-state-machine channels, where a \emph{classical} state evolves over…

Information Theory · Computer Science 2022-07-22 Michael X. Cao , Pascal O. Vontobel

This letter establishes a unified analytical framework to study the asymptotic average mutual information (AMI) of mixture gamma (MG) distributed fading channels driven by finite input signals in the high signal-to-noise ratio (SNR) regime.…

Information Theory · Computer Science 2021-11-29 Chongjun Ouyang , Sheng Wu , Chunxiao Jiang , Yuanwei Liu , Julian Cheng , Hongwen Yang

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of…

Information Theory · Computer Science 2008-12-31 Tal Philosof , Ram Zamir , Uri Erez

The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…

Quantum Physics · Physics 2009-11-10 Garry Bowen , Igor Devetak , Stefano Mancini

We calculate the information capacities of a time-correlated amplitude-damping channel, provided the sender and receiver share prior entanglement. Our analytical results show that the noisy channel with zero capacity can transmit…

Quantum Physics · Physics 2013-07-23 Nigum Arshed , A. H. Toor

We consider optical communications with intensity modulation and direct detection affected by laser relative intensity noise (RIN). Starting from a continuous-time waveform model, we derive an equivalent discrete-time channel model. As a…

Information Theory · Computer Science 2026-05-11 Felipe Villenas , Yunus Can Gültekin , Alex Alvarado

The mutual information (MI) of Poisson-type channels has been linked to a filtering problem since the 70s, but its evaluation for specific continuous-time, discrete-state systems remains a demanding task. As an advantage, Markov renewal…

Information Theory · Computer Science 2024-06-18 Maximilian Gehri , Nicolai Engelmann , Heinz Koeppl