中文
相关论文

相关论文: Identification over Affine Poisson Channels: Appli…

200 篇论文

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

信息论 · 计算机科学 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

We develop a novel framework for proving converse theorems for channel coding, which is based on the analysis technique of multicast transmission with an additional auxiliary receiver, which serves as a genie to the original receiver. The…

信息论 · 计算机科学 2022-09-02 Anelia Somekh-Baruch

In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword $(x_1,...,x_n)$…

信息论 · 计算机科学 2016-11-17 Bikash Kumar Dey , Sidharth Jaggi , Michael Langberg , Anand D. Sarwate

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…

量子物理 · 物理学 2009-11-13 I. Bjelakovic , H. Boche , J. Noetzel

Odor-based Molecular Communication (OMC) employs odor molecules to convey information, contributing to the realization of the Internet of Everything (IoE) vision. Despite this, the practical deployment of OMC systems is currently limited by…

信号处理 · 电气工程与系统科学 2026-02-03 Ahmet B. Kilic , Fatih E. Bilgen , Ozgur B. Akan

In this paper, we study a model of communication under adversarial noise. In this model, the adversary makes online decisions on whether to corrupt a transmitted bit based on only the value of that bit. Like the usual binary symmetric…

信息论 · 计算机科学 2014-01-21 Arya Mazumdar

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…

信息论 · 计算机科学 2015-09-01 Siavash Ghavami , Raviraj Adve , Farshad Lahouti

The problem of identifying the channel with the highest capacity among several discrete memoryless channels (DMCs) is considered. The problem is cast as a pure-exploration multi-armed bandit problem, which follows the practical use of…

信息论 · 计算机科学 2024-01-19 Maximilian Egger , Rawad Bitar , Antonia Wachter-Zeh , Deniz Gündüz , Nir Weinberger

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless…

信息论 · 计算机科学 2008-07-30 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

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…

信息论 · 计算机科学 2012-08-21 Stefano Rini , Carolin Huppert

In this work, we study two models of arbitrarily varying channels, when causal side information is available at the encoder in a causal manner. First, we study the arbitrarily varying channel (AVC) with input and state constraints, when the…

信息论 · 计算机科学 2017-01-23 Uzi Pereg , Yossef Steinberg

We employ a unified framework for computing the information capacity of biological signaling systems using Fisher Information. By deriving closed-form or easily computable information capacity formulas, we quantify how well different…

定量方法 · 定量生物学 2025-05-14 Michał Komorowski

A diffusion-based molecular communication system has two major components: the diffusion in the medium, and the ligand-reception. Information bits, encoded in the time variations of the concentration of molecules, are conveyed to the…

信息论 · 计算机科学 2012-05-23 Arash Einolghozati , Mohsen Sardari , Faramarz Fekri

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide an upper bound on the capacity of this channel. We then show that, when the…

信息论 · 计算机科学 2012-02-16 Nan Liu , Ivana Maric , Yinghui Cheng , Andrea J. Goldsmith , Shlomo Shamai

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…

信息论 · 计算机科学 2018-07-02 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

Molecular communication is a biologically-inspired method of communication with attractive properties for microscale and nanoscale devices. In molecular communication, messages are transmitted by releasing a pattern of molecules at a…

信息论 · 计算机科学 2008-12-09 Andrew W. Eckford

This work presents a new multi-chemical experimental platform for molecular communication where the transmitter can release different chemicals. This platform is designed to be inexpensive and accessible, and it can be expanded to simulate…

新兴技术 · 计算机科学 2017-04-18 Nariman Farsad , David Pan , Andrea Goldsmith

The ubiquity of information transmission via molecular communication between cells is comprehensively documented on Earth; this phenomenon might even have played a vital role in the origin(s) and early evolution of life. Motivated by these…

地球与行星天体物理 · 物理学 2024-01-26 Manasvi Lingam

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…

量子物理 · 物理学 2021-10-26 Xin Wang

We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly…

信息论 · 计算机科学 2023-10-30 Jennifer Tang , Yury Polyanskiy
‹ 上一页 1 8 9 10 下一页 ›