English
Related papers

Related papers: On Mismatched Oblivious Relaying

200 papers

We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…

Information Theory · Computer Science 2022-09-05 Anelia Somekh-Baruch

We study the problem of communication over a discrete arbitrarily varying channel (AVC) when a noisy version of the state is known non-causally at the encoder. The state is chosen by an adversary which knows the coding scheme. A…

Information Theory · Computer Science 2018-04-30 Amitalok J. Budkuley , Sidharth Jaggi

We study reliable communication in uncoordinated vehicular communication from the perspective of Shannon theory. Our system model for the information transmission is that of an Arbitrarily Varying Channel (AVC): One sender-receiver pair…

Information Theory · Computer Science 2019-06-06 Christian Arendt , Janis Nötzel , Holger Boche

Classical information theory typically assumes reliable receiver-side processing. We study remote inference when communication is noisy and the receiver itself is built from unreliable components under a finite redundancy budget. Under a…

Information Theory · Computer Science 2026-04-22 Zhenyu Liu , Yi Ma , Rahim Tafazolli

The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation…

Information Theory · Computer Science 2016-11-15 Pablo Piantanida , Sajad Sadough , Pierre Duhamel

Blind rendezvous is a fundamental problem in cognitive radio networks. The problem involves a collection of agents (radios) that wish to discover each other in the blind setting where there is no shared infrastructure and they initially…

Networking and Internet Architecture · Computer Science 2014-01-29 Sixia Chen , Alexander Russell , Abhishek Samanta , Ravi Sundaram

We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless…

Information Theory · Computer Science 2016-06-01 Lawrence Ong , Roy Timo

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

Molecular communication (MC) allows nanomachines to communicate and cooperate with each other in a fluid environment. The diffusion-based MC is popular but is easily constrained by the transmit distance due to the severe attenuation of…

Information Theory · Computer Science 2021-04-28 Shuo Yuan , Jiaxing Wang , Mugen Peng

This study investigates wireless information and energy transfer for dual-hop amplify-and-forward full-duplex relaying systems. By forming energy efficiency (EE) maximization problem into a concave fractional program of transmission power,…

Information Theory · Computer Science 2015-11-03 Hongwu Liu , Kyeong Jin Kim , H. Vincent Poor , Kyung Sup Kwak

This paper addresses robust communication on a fading relay channel in which the relay is connected to the decoder via an out-of-band digital link of limited capacity. Both the source-to-relay and the source-to-destination links are subject…

Information Theory · Computer Science 2013-03-21 Seok-Hwan Park , Osvaldo Simeone , Onur Sahin , Shlomo Shamai

This paper considers the covert identification problem in which a sender aims to reliably convey an identification (ID) message to a set of receivers via a binary-input discrete memoryless channel (BDMC), and simultaneously to guarantee…

Information Theory · Computer Science 2021-06-04 Qiaosheng Zhang , Vincent Y. F. Tan

The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…

Information Theory · Computer Science 2017-07-11 Achilleas Anastasopoulos , Jui Wu

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

The reliability and transmission distance are generally limited for the wireless communications due to the severe channel fading. As an effective way to resist the channel fading, cooperative relaying is usually adopted in wireless networks…

Information Theory · Computer Science 2017-05-19 Hao Niu , Yao Sun , Kaoru Sezaki

Information bottleneck (IB) is a paradigm to extract information in one target random variable from another relevant random variable, which has aroused great interest due to its potential to explain deep neural networks in terms of…

Information Theory · Computer Science 2023-08-23 Lingyi Chen , Shitong Wu , Wenhao Ye , Huihui Wu , Hao Wu , Wenyi Zhang , Bo Bai , Yining Sun

The main objective of this paper is to analyze a closed-loop feedback system where a transmitter probes a discrete memoryless channel (DMC) and can adapt its inputs based on the previous channel outputs. We prove that, regardless of the…

Information Theory · Computer Science 2025-07-23 Thomas Sturma , Michèle Wigger

In this paper, channel estimation and data detection for multihop relaying orthogonal frequency division multiplexing (OFDM) system is investigated under time-varying channel. Different from previous works, which highly depend on the…

Information Theory · Computer Science 2012-05-25 Rui Min , Yik-Chung Wu

The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decodeand- forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate…

Information Theory · Computer Science 2013-01-04 Vo Nguyen Quoc Bao , Tran Thien Thanh , Tuan Duc Nguyen , Thanh Dinh Vu

We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence $T$, which is independent of the channel input $X$. The channel is…

Information Theory · Computer Science 2008-10-07 Ravi Tandon , Sennur Ulukus