English
Related papers

Related papers: Capacity Limits of Diffusion-Based Molecular Timin…

200 papers

In this paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The…

Information Theory · Computer Science 2016-11-18 K. Alishahi , F. Marvasti , V. Aref , P. Pad

We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carry-forward routing. We…

Networking and Internet Architecture · Computer Science 2016-11-18 Philippe Jacquet , Bernard Mans , Georgios Rodolakis

In this paper, diffusion-based molecular commu- nication with ligand receptor receivers is studied. Information messages are assumed to be encoded via variations of the con- centration of molecules. The randomness in the ligand reception…

Information Theory · Computer Science 2015-11-10 Mehrdad Tahmasbi , Faramarz Fekri

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

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

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

Non-orthogonal communications play an important role in future communication architectures. In such scenarios, the received signal is corrupted by an interfering signal which is typically cyclostationary in continuous-time. If the period of…

Information Theory · Computer Science 2019-10-18 Nir Shlezinger , Emeka Abakasanga , Ron Dabora , Yonina C. Eldar

The Binomial channel serves as a fundamental model for molecular communication (MC) systems employing molecule-counting receivers. Here, deterministic identification (DI) is addressed for the discrete-time Binomial channels (DTBC), subject…

Information Theory · Computer Science 2023-04-26 Mohammad Javad Salariseddigh , Vahid Jamali , Holger Boche , Christian Deppe , Robert Schober

In this work, we consider diffusion-based molecular communication with and without drift between two static nano-machines. We employ type-based information encoding, releasing a single molecule per information bit. At the receiver, we…

Information Theory · Computer Science 2018-07-13 Werner Haselmayr , Neeraj Varshney , A. Taufiq Asyhari , Andreas Springer , Weisi Guo

Molecular communication (MC) enables information exchange at the nano- and microscale, with applications in areas like drug delivery and health monitoring. These event-driven scenarios often require alternatives to traditional transmission.…

Information Theory · Computer Science 2025-06-18 Yaning Zhao , Luca Miszewski , Christian Deppe , Massimiliano Pierobon

This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly…

Information Theory · Computer Science 2018-03-06 Mehrnaz Tavan , Roy D. Yates , Waheed U. Bajwa

An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…

Information Theory · Computer Science 2015-03-13 Bernd Bandemer , Abbas El Gamal

In diffusion-based communication, as for molecular systems, the achievable data rate is very low due to the slow nature of diffusion and the existence of severe inter-symbol interference (ISI). Multiple-input multiple-output (MIMO)…

Information Theory · Computer Science 2018-01-23 S. Mohammadreza Rouzegar , Umberto Spagnolini

We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we…

Information Theory · Computer Science 2020-08-11 Prabha Mandayam , Krishna Jagannathan , Avhishek Chatterjee

The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…

Information Theory · Computer Science 2016-09-29 Borzoo Rassouli , Bruno Clerckx

Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and…

Information Theory · Computer Science 2018-11-07 Ori Shmuel , Asaf Cohen , Omer Gurewitz

There are now several works on the use of the additive inverse Gaussian noise (AIGN) model for the random transit time in molecular communication~(MC) channels. The randomness invariably causes inter-symbol interference (ISI) in MC, an…

Information Theory · Computer Science 2015-09-01 Siavash Ghavami , Raviraj Adve , Farshad Lahouti

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

In this paper, a simple memory limited transmitter for molecular communication is proposed, in which information is encoded in the diffusion rate of the molecules. Taking advantage of memory, the proposed transmitter reduces the ISI problem…

Information Theory · Computer Science 2014-10-30 Mohammad Movahednasab , Mehdi Soleimanifar , Amin Gohari , Masoumeh Nasiri Kenari , Urbashi Mitra

We derive information-theoretic converses (i.e., lower bounds) for the minimum time required by any algorithm for distributed function computation over a network of point-to-point channels with finite capacity, where each node of the…

Information Theory · Computer Science 2017-01-04 Aolin Xu , Maxim Raginsky