English
Related papers

Related papers: Deterministic Identification for Molecular Communi…

200 papers

Given a probability distribution $\mathcal{D}$ over the non-negative integers, a $\mathcal{D}$-repeat channel acts on an input symbol by repeating it a number of times distributed as $\mathcal{D}$. For example, the binary deletion channel…

Information Theory · Computer Science 2022-02-08 Francisco Pernice , Ray Li , Mary Wootters

This paper focuses on molecular communication (MC) systems where the signaling molecules may participate in a reversible bimolecular reaction in the channel. The motivation for studying these MC systems is that they can realize the concept…

Information Theory · Computer Science 2017-11-02 Vahid Jamali , Nariman Farsad , Robert Schober , Andrea Goldsmith

We study the problem of designing optical receivers to discriminate between multiple coherent states using coherent processing receivers---i.e., one that uses arbitrary coherent feedback control and quantum-noise-limited direct…

Quantum Physics · Physics 2017-07-26 Hye Won Chung , Saikat Guha , Lizhong Zheng

The secrecy capacity of the type II wiretap channel (WTC II) with a noisy main channel is currently an open problem. Herein its secrecy-capacity is derived and shown to be equal to its semantic-security (SS) capacity. In this setting, the…

Information Theory · Computer Science 2016-08-18 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

Many communication channels with discrete input have non-uniform capacity achieving probability mass functions (PMF). By parsing a stream of independent and equiprobable bits according to a full prefix-free code, a modu-lator can generate…

Information Theory · Computer Science 2011-01-04 Georg Böcherer , Rudolf Mathar

In this paper, we introduce the general concept of coded power control (CPC) in a particular setting of the interference channel. Roughly, the idea of CPC consists in embedding information (about a random state) into the transmit power…

Information Theory · Computer Science 2014-05-28 Benjamin Larrousse , Samson Lasaulce

Let $W$ be a binary-input memoryless symmetric (BMS) channel with Shannon capacity $I(W)$ and fix any $\alpha > 0$. We construct, for any sufficiently small $\delta > 0$, binary linear codes of block length $O(1/\delta^{2+\alpha})$ and rate…

Information Theory · Computer Science 2022-01-25 Venkatesan Guruswami , Andrii Riazanov , Min Ye

In this paper, we develop a mathematical framework for modeling the time-variant stochastic channels of diffusive mobile MC systems. In particular, we consider a diffusive mobile MC system consisting of a pair of transmitter and receiver…

Information Theory · Computer Science 2018-07-12 Arman Ahmadzadeh , Vahid Jamali , Robert Schober

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 discrete-time Poisson noise channel with an input amplitude constraint $\mathsf{A}$ and a dark current parameter $\lambda$. It is known that the capacity-achieving distribution for this channel is discrete with…

Information Theory · Computer Science 2024-01-11 Luca Barletta , Alex Dytso , Shlomo Shamai

Molecular communication is a new field of communication where molecules are used to transfer information. Among the proposed methods, molecular communication via diffusion (MCvD) is particularly effective. One of the main challenges in MCvD…

Emerging Technologies · Computer Science 2014-10-31 Burcu Tepekule , Ali E. Pusane , H. Birkan Yilmaz , Chan-Byoung Chae , Tuna Tugcu

The conditional intensity (CI) of a counting process $Y_t$ is based on the minimal knowledge $\mathcal{F}_t^Y$, i.e., on the observation of $Y_t$ alone. Prominently, the mutual information rate of a signal and its Poisson channel output is…

Information Theory · Computer Science 2022-05-17 Mark Sinzger-D'Angelo , Heinz Koeppl

In this paper, we consider a diffusive mobile molecular communication (MC) system consisting of a pair of mobile transmitter and receiver nano-machines suspended in a fluid medium, where we model the mobility of the nano-machines by…

Information Theory · Computer Science 2017-04-24 Arman Ahmadzadeh , Vahid Jamali , Robert Schober

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…

Quantum Physics · Physics 2007-05-23 Charles H. Bennett , Peter W. Shor , John A. Smolin , Ashish V. Thapliyal

We consider channel coding for discrete memoryless channels (DMCs) with a novel cost constraint that constrains both the mean and the variance of the cost of the codewords. We show that the maximum (asymptotically) achievable rate under the…

Information Theory · Computer Science 2025-01-23 Adeel Mahmood , Aaron B. Wagner

This manuscript investigates channel capacity under mismatched stochastic likelihood decoding. We derive Feinstein- and Verd\'u-Han-style bounds on the error probability coded communication. These are used to obtain a general…

Information Theory · Computer Science 2026-04-21 Francesc Molina , Albert Guillen i Fabregas

Motivated by recent discoveries of microbial communities that transfer electrons across centimeter-length scales, this paper studies the information capacity of bacterial cables via electron transfer, which coexists with molecular…

Information Theory · Computer Science 2015-01-19 Nicolo Michelusi , Urbashi Mitra

Bacterial chemotactic sensing converts noisy chemical signals into running and tumbling. We analyze the static sensing limits of mixed Tar/Tsr chemoreceptor clusters in individual Escherichia coli cells using a heterogeneous…

Quantitative Methods · Quantitative Biology 2026-02-24 Ziyi Cui , Sarah Marzen

We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive schemes, under a zero probability of error criterion. We derive single-letter inner and outer bounds for the zero-error capacity region,…

Information Theory · Computer Science 2021-09-13 Yujie Gu , Ofer Shayevitz

This paper studies the third-order characteristic of nonsingular discrete memoryless channels and the Gaussian channel with a maximal-power constraint. The third-order term in our expansions employs a new quantity here called the channel…

Information Theory · Computer Science 2024-08-23 Recep Can Yavas , Victoria Kostina , Michelle Effros