English
Related papers

Related papers: Binary Causal-Adversary Channels

200 papers

Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how…

Quantum Physics · Physics 2024-09-25 Xinan Chen , Yujie Zhang , Andreas Winter , Virginia O. Lorenz , Eric Chitambar

This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…

Information Theory · Computer Science 2008-12-31 G. Chung , S. Sridharan , S. Vishwanath , C. S. Hwang

Machine learning has been widely applied in wireless communications. However, the security aspects of machine learning in wireless applications have not been well understood yet. We consider the case that a cognitive transmitter senses the…

Networking and Internet Architecture · Computer Science 2019-01-29 Yi Shi , Tugba Erpek , Yalin E. Sagduyu , Jason H. Li

Wireless low-power transceivers used in sensor networks such as IEEE 802.15.4 typically operate in unlicensed frequency bands that are subject to external interference from devices transmitting at much higher power. Communication protocols…

Networking and Internet Architecture · Computer Science 2012-02-23 Carlo Alberto Boano , Kay Römer , Marco Antonio Zúñiga , Thiemo Voigt

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

In this paper, a generalization of the traditional point-to-point to communication setup, which is named as "reliable communications with asymmetric codebooks", is proposed. Under the assumption of independent identically distributed…

Information Theory · Computer Science 2008-09-12 Yucel Altug , M. Kivanc Mihcak , Onur Ozyesil , Vishal Monga

This paper investigates an information-theoretic model of secure semantic-aware communication. For this purpose, we consider the lossy joint source-channel coding (JSCC) of a memoryless semantic source transmitted over a memoryless wiretap…

Information Theory · Computer Science 2026-05-26 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

We consider asynchronous communication over point-to-point discrete memoryless channels. The transmitter starts sending one block codeword at an instant that is uniformly distributed within a certain time period, which represents the level…

Information Theory · Computer Science 2007-08-01 Aslan Tchamkerten , Venkat Chandar , Gregory Wornell

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

We consider the problem of communicating over a channel that randomly "tears" the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length $n$ and pieces of length ${\rm…

Information Theory · Computer Science 2020-05-27 Ilan Shomorony , Alireza Vahid

We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under attack of a malignant third party. These codes are robust to different kinds of channel uncertainty. To…

Mathematical Physics · Physics 2019-03-27 Holger Boche , Gisbert Janßen , Sajad Saeedinaeeni

In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a…

Information Theory · Computer Science 2012-07-17 K. G. Nagananda , Chandra R. Murthy , Shalinee Kishore

We introduce the blind index coding (BIC) problem, in which a single sender communicates distinct messages to multiple users over a shared channel. Each user has partial knowledge of each message as side information. However, unlike classic…

Information Theory · Computer Science 2015-09-02 David T. H. Kao , Mohammad Ali Maddah-Ali , A. Salman Avestimehr

We consider the problem of estimating a signal corrupted by independent interference with the assistance of a cost-constrained helper who knows the interference causally or noncausally. When the interference is known causally, we…

Information Theory · Computer Science 2012-03-21 Yeow-Khiang Chia , Rajiv Soundararajan , Tsachy Weissman

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

Any physical channel of communication offers two potential reasons why its capacity (the number of bits it can transmit in a unit of time) might be unbounded: (1) Infinitely many choices of signal strength at any given instant of time, and…

Information Theory · Computer Science 2011-05-18 Sanjeev Khanna , Madhu Sudan

We study a Bayesian persuasion setting in which a sender wants to persuade a critical mass of receivers by revealing partial information about the state to them. The homogeneous binary-action receivers are located on a communication…

Computer Science and Game Theory · Computer Science 2025-09-12 Toygar T. Kerman , Anastas P. Tenev , Konstantin Zabarnyi

Several aspects of the problem of asynchronous point-to-point communication without feedback are developed when the source is highly intermittent. In the system model of interest, the codeword is transmitted at a random time within a…

Information Theory · Computer Science 2012-07-10 Aslan Tchamkerten , Venkat Chandar , Gregory Wornell

We consider a channel with a binary input X being corrupted by a continuous-valued noise that results in a continuous-valued output Y. An optimal binary quantizer is used to quantize the continuous-valued output Y to the final binary output…

Signal Processing · Electrical Eng. & Systems 2020-01-08 Thuan Nguyen , Thinh Nguyen

We propose the use of adversarial wireless jamming to regularise the latent space of an autoencoder to match a diagonal Gaussian distribution. We consider the minimisation of a mean squared error distortion, where a jammer attempts to…

Machine Learning · Computer Science 2025-12-03 Waleed El-Geresy , Deniz Gündüz
‹ Prev 1 8 9 10 Next ›