English
Related papers

Related papers: Identification over Affine Poisson Channels: Appli…

200 papers

Identification in quantum communication enables receivers to verify the presence of a message without decoding its entire content. While identification capacity has been explored for classical and finite-dimensional quantum channels, its…

Quantum Physics · Physics 2025-12-02 Zuhra Amiri , Janis Nötzel

Molecular recognition, which is essential in processing information in biological systems, takes place in a crowded noisy biochemical environment and requires the recognition of a specific target within a background of various similar…

Biomolecules · Quantitative Biology 2010-07-27 Yonatan Savir , Tsvi Tlusty

In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to analyze the achievable capacity in transmission of information from one…

Information Theory · Computer Science 2011-05-11 Arash Einolghozati , Mohsen Sardari , Ahmad Beirami , Faramarz Fekri

This paper studies the impact of a transmitter's molecule generation process on the capacity of a concentration based Molecular Communication (MC) system. Constraints caused by the molecule generation process affect the availability of the…

Information Theory · Computer Science 2018-02-27 Hamid G. Bafghi , Amin Gohari , Mahtab Mirmohseni , Masoumeh Nasiri-Kenari

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

This paper studies the capacity of molecular communications in fluid media, where the information is encoded in the number of transmitted molecules in a time-slot (amplitude shift keying). The propagation of molecules is governed by random…

Information Theory · Computer Science 2016-04-29 Siavash Ghavami , Raviraj Adve , Farshad Lahouti

We study message identification over the noisy permutation channel. For discrete memoryless channels (DMCs), the number of identifiable messages grows doubly exponentially, and the maximum second-order exponent is same as the Shannon…

Information Theory · Computer Science 2025-06-18 Abhishek Sarkar , Bikash Kumar Dey

Deterministic identification (DI) for the discrete-time Poisson channel, subject to an average and a peak power constraint, is considered. It is established that the code size scales as $2^{(n\log n)R}$, where $n$ and $R$ are the block…

Information Theory · Computer Science 2021-09-29 Mohammad J. Salariseddigh , Uzi Pereg , Holger Boche , Christian Deppe , Robert Schober

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

This work introduces the particle-intensity channel (PIC) as a model for molecular communication systems and characterizes the capacity limits as well as properties of the optimal (capacity-achieving) input distributions for such channels.…

Deterministic identification over K-input multiple-access channels with average input cost constraints is considered. The capacity region for deterministic identification is determined for an average-error criterion, where arbitrarily large…

Information Theory · Computer Science 2023-06-21 Johannes Rosenberger , Abdalla Ibrahim , Christian Deppe , Roberto Ferrara

The development of optimal and efficient machine learning-based communication systems is likely to be a key enabler of beyond 5G communication technologies. In this direction, physical layer design has been recently reformulated under a…

Information Theory · Computer Science 2021-11-16 Nunzio A. Letizia , Andrea M. Tonello

We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…

Information Theory · Computer Science 2015-04-06 Tobias Sutter , David Sutter , Peyman Mohajerin Esfahani , John Lygeros

Identification over quantum broadcast channels is considered. As opposed to the information transmission task, the decoder only identifies whether a message of his choosing was sent or not. This relaxation allows for a double-exponential…

Quantum Physics · Physics 2023-08-02 Johannes Rosenberger , Christian Deppe , Uzi Pereg

We consider anomalous diffusion for molecular communication with a passive receiver. We first consider the probability density function of molecules' location at a given time in a space of arbitrary dimension. The expected number of…

Information Theory · Computer Science 2021-07-09 Dung Phuong Trinh , Youngmin Jeong , Sang-Hyo Kim

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

Molecular communication (MC) is an emerging paradigm that enables data transmission through biochemical signals rather than traditional electromagnetic waves. This approach is particularly promising for environments where conventional…

Information Theory · Computer Science 2025-03-17 Vida Gholamiyan , Yaning Zhao , Wafa Labidi , Holger Boche , Christian Deppe

We investigate the fundamental limits of reliable communication over multi-view channels, in which the channel output is comprised of a large number of independent noisy views of a transmitted symbol. We consider first the setting of…

Information Theory · Computer Science 2024-05-14 V. Arvind Rameshwar , Nir Weinberger

We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders…

Information Theory · Computer Science 2026-05-04 Mohammad Javad Salariseddigh , Christian Deppe

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