English
Related papers

Related papers: On the Capacity of Diffusion-Based Molecular Timin…

200 papers

We introduce conferencing-based distributed channel quantizers for two-user interference networks where interference signals are treated as noise. Compared with the conventional distributed quantizers where each receiver quantizes its own…

Information Theory · Computer Science 2014-04-01 Xiaoyi Leo Liu , Erdem Koyuncu , Hamid Jafarkhani

Noisy quantum channels may be used in many information carrying applications. We show that different applications may result in different channel capacities. Upper bounds on several of these capacities are proved. These bounds are based on…

Quantum Physics · Physics 2009-10-30 Howard Barnum , M. A. Nielsen , Benjamin Schumacher

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

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

This work introduces the particle-intensity channel (PIC) as a model for molecular communication systems and characterizes the properties of the optimal input distribution and the capacity limits for this system. In the PIC, the transmitter…

Information Theory · Computer Science 2017-05-24 Nariman Farsad , Christopher Rose , Muriel Médard , Andrea Goldsmith

We study the motion of Brownian particle in modulated media in the strong damping limit by using {\em toy model}, with special emphasis on the transition from localise to diffusive behavior. By using model potential we have seen the…

Statistical Mechanics · Physics 2007-05-23 Himadri S. Samanta

Which communication rates can be attained over a channel whose output is an unknown (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? Following the spirit of the finite-state…

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

We study the problem of computing the capacity of a discrete memoryless channel under uncertainty affecting the channel law matrix, and possibly with a constraint on the average cost of the input distribution. The problem has been…

Information Theory · Computer Science 2018-05-28 Krzysztof Postek , Aharon Ben-Tal

This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the…

Information Theory · Computer Science 2020-05-01 Avi Steiner , Shlomo Shamai

The capacity of a discrete-time channel with correlated phase noises is investigated. In particular, the electro-optic frequency comb system is considered, where the phase noise of each subchannel is a combination of two independent Wiener…

Information Theory · Computer Science 2025-07-15 Mohammad Farsi , Hamdi Joudeh , Gabriele Liga , Alex Alvarado , Magnus Karlsson , Erik Agrell

This work considers an additive noise channel where the time-k noise variance is a weighted sum of the channel input powers prior to time k. This channel is motivated by point-to-point communication between two terminals that are embedded…

Information Theory · Computer Science 2016-11-17 Tobias Koch , Amos Lapidoth , Paul P. Sotiriadis

The capacity of a channel is known to be equivalent to the highest rate at which it can generate entanglement. Analogous to entanglement, the notion of a causality measure characterises the temporal aspect of quantum correlations. Despite…

Quantum Physics · Physics 2020-02-24 Robert Pisarczyk , Zhikuan Zhao , Yingkai Ouyang , Vlatko Vedral , Joseph F. Fitzsimons

In this paper, the fundamental limits on the rates at which information and energy can be simultaneously transmitted over an additive white Gaussian noise channel are studied under the following assumptions: $(a)$ the channel is memoryless;…

Information Theory · Computer Science 2021-10-06 Sadaf ul Zuhra , Samir M. Perlaza , Eitan Altman

We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial…

Information Theory · Computer Science 2016-11-17 Parastoo Sadeghi , Pascal O. Vontobel , Ramtin Shams

The two-way capacities of quantum channels determine the ultimate entanglement and secret-key distribution rates achievable by two distant parties that are connected by a noisy transmission line, in absence of quantum repeaters. Since…

Quantum Physics · Physics 2025-01-27 Francesco Anna Mele , Ludovico Lami , Vittorio Giovannetti

We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels $(\Xi^n)_{n \in \mathbb{N}}$ modelled as a discrete quantum Markov semigroup, long enough to generate…

Quantum Physics · Physics 2025-09-04 Archishna Bhattacharyya

The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known.…

Quantum Physics · Physics 2011-03-31 Markus Grassl , Zhengfeng Ji , Zhaohui Wei , Bei Zeng

In biological cells and novel diagnostic devices biochemical receptors need to be sensitive to extremely small concentration changes of signaling molecules. The accuracy of such molecular signaling is ultimately limited by the counting…

Subcellular Processes · Quantitative Biology 2023-04-06 Aljaz Godec , Ralf Metzler

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

We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast…

Information Theory · Computer Science 2016-11-18 Ahmed Badr , Devin Lui , Ashish Khisti