English
Related papers

Related papers: Deterministic Identification for Molecular Communi…

200 papers

We show that the Extrinsic Information about the coded bits of any good (capacity achieving) code operating over a wide class of discrete memoryless channels (DMC) is zero when channel capacity is below the code rate and positive constant…

Information Theory · Computer Science 2007-07-13 Michael Peleg , Amichai Sanderovich , Shlomo Shamai

We establish the capacity region for a class of discrete memoryless cognitive interference channel (DM-CIC) called cognitive-more-capable channel, and we show that superposition coding is the optimal encoding technique. This is the largest…

Information Theory · Computer Science 2014-01-21 Mojtaba Vaezi

Doubly-selective channels, such as those that occur when the transmitter and the receiver move relative to each other at high speeds, are a key scenario for fifth generation (5G) cellular systems, which are mostly based in the use of the…

Signal Processing · Electrical Eng. & Systems 2024-01-30 Tomás Domínguez-Bolaño , José Rodríguez-Piñeiro , José A. García-Naya , Luis Castedo

Mobile molecular communication (MC) links with counting receivers are sensitive to transmitter--receiver geometry especially when nodes are mobile. We study binary detection from within-symbol count observations with unknown finite-memory…

Systems and Control · Electrical Eng. & Systems 2026-04-20 Shaojie Zhang , Ozgur B. Akan

Channel memory and inter-symbol interference (ISI) are harmful factors in diffusion-based molecular communication (DBMC) between bionanosensors. To tackle these problems, this paper proposes a lightweight ISI-mitigating coding scheme to…

Information Theory · Computer Science 2023-05-24 Dongliang Jing , Andrew W. Eckford

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

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be…

Information Theory · Computer Science 2019-04-09 Lan V. Truong , Vincent Y. F. Tan

We study two-receiver Poisson channels using tools derived from stochastic calculus. We obtain a general formula for the mutual information over the Poisson channel that allows for conditioning and the use of auxiliary random variables. We…

Information Theory · Computer Science 2019-11-12 Nirmal V. Shende , Aaron B. Wagner

Partial ordering of communication channels has applications in performance analysis, and goes beyond comparisons of channels just on the basis of their Shannon capacity or error probability. Shannon defined a partial order of channel…

Information Theory · Computer Science 2021-05-07 Cihan Tepedelenlioglu

Optical wireless communication (OWC) using intensity-modulation and direct-detection (IM/DD) has a channel model which possesses unique features, due to the constraints imposed on the channel input. The aim of this tutorial is to overview…

Information Theory · Computer Science 2021-10-13 Anas Chaaban , Zouheir Rezki , Mohamed-Slim Alouini

This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs…

Information Theory · Computer Science 2016-11-17 Ligong Wang , Gregory Wornell , Lizhong Zheng

This paper studies the capacity of the two-user intensity-modulation/direct-detection (IM/DD) interference channel (IC), which is relevant in the context of multi-user optical wireless communications. Despite some known single-letter…

Information Theory · Computer Science 2022-07-05 Zhenyu Zhang , Anas Chaaban

The sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by…

Information Theory · Computer Science 2012-07-16 Fangfang Zhu , Biao Chen

In [1], it is shown that the simultaneous identification capacity region for the discrete, memoryless, classical-quantum multiple access channel is equal to the transmission capacity region for codes using a deterministic encoding scheme.…

Quantum Physics · Physics 2019-03-11 Stephen Diadamo , Holger Boche

The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably simulated over the channel, using a deterministic coding…

Information Theory · Computer Science 2021-08-13 Assaf Ben-Yishai , Young-Han Kim , Or Ordentlich , Ofer Shayevitz

The capacity of the semideterministic discrete memoryless broadcast channel (SD-BC) with partial message side-information (P-MSI) at the receivers is established. In the setting without a common message, it is shown that P-MSI to the…

Information Theory · Computer Science 2017-05-30 Annina Bracher , Michèle Wigger

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

In this paper the study of 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. We derive the capacity for the…

Information Theory · Computer Science 2012-02-07 Stefano Rini , Carolin Huppert

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang
‹ Prev 1 3 4 5 6 7 10 Next ›