English
Related papers

Related papers: Adversarial Channels with O(1)-Bit Partial Feedbac…

200 papers

In this paper, first, we investigate the model of degraded broadcast channel with side information and confidential messages. This work is from Steinberg's work on the degraded broadcast channel with causal and noncausal side information,…

Information Theory · Computer Science 2016-11-17 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

Consider a pair of terminals connected by two independent (feedforward and feedback) Additive White Gaussian Noise (AWGN) channels, and limited by individual power constraints. The first terminal would like to reliably send information to…

Information Theory · Computer Science 2015-04-16 Assaf Ben-Yishai , Ofer Shayevitz

It is well known that, in general, feedback may enlarge the capacity region of Gaussian broadcast channels. This has been demonstrated even when the feedback is noisy (or partial-but-perfect) and only from one of the receivers. The only…

Information Theory · Computer Science 2015-02-18 Sibi Raj B. Pillai , Vinod M. Prabhakaran

The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it…

Information Theory · Computer Science 2011-10-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and…

Information Theory · Computer Science 2016-11-18 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

Opportunistic interference alignment (OIA) exploits channel randomness and multiuser diversity by user selection. For OIA the transmitter needs channel state information (CSI), which is usually measured on the receiver side and sent to the…

Information Theory · Computer Science 2015-05-06 Zhinan Xu , Mingming Gan , Thomas Zemen

Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum…

Quantum Physics · Physics 2016-08-31 André Chailloux , Gus Gutoski , Jamie Sikora

We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes…

Quantum Physics · Physics 2020-01-28 Seunghoan Song , Masahito Hayashi

To model printing noise a binary noisy channel and a set of controlled gates are introduced. The channel input is an image created by a halftoning algorithm and its output is the printed picture. Using this channel robustness to noise…

Other Computer Science · Computer Science 2015-03-19 V. N. Gorbachev , E. S. Yakovleva

In this technical report, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios…

Information Theory · Computer Science 2016-11-16 Victor Quintero , Samir M. Perlaza , Jean-Marie Gorce

We address the problem of Reliable Broadcast in asynchronous message-passing systems with $n$ nodes, of which up to $t$ are malicious (faulty), in addition to a message adversary that can drop some of the messages sent by correct…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-15 Timothé Albouy , Davide Frey , Ran Gelles , Carmit Hazay , Michel Raynal , Elad Michael Schiller , François Taïani , Vassilis Zikas

Quantum secure direct communication is one of the important mode of quantum communication, which sends secret information through a quantum channel directly without setting up a prior key. Over the past decade, numerous protocols have been…

Quantum Physics · Physics 2017-06-13 Jianyong Hu , Mingyong Jing , Peng Zhang , Qiangqiang Zhang , Huifang Hou , Liantuan Xiao , Suotang Jia

We consider codes over the alphabet Q={0,1,..,q-1}intended for the control of unidirectional errors of level l. That is, the transmission channel is such that the received word cannot contain both a component larger than the transmitted one…

Information Theory · Computer Science 2007-07-13 R. Ahlswede , H. Aydinian , L. H. Khachatrian , L. M. G. M. Tolhuizen

This paper consider a new secure communication scene where a full-duplex transmitter (Alan) need to transmit confidential information to a half-duplex receiver (Bob), with a silent eavesdropper (Eve) that tries to eavesdrop the confidential…

Networking and Internet Architecture · Computer Science 2017-10-20 Xinyue Hu , Caihong Kai , Shengli Zhang , Zhongyi Guo , Jun Gao

In modern communication systems with feedback, there are increasingly more scenarios where the transmitter has much less power than the receiver (e.g., medical implant devices), which we refer to as noise-asymmetric channels. For such…

Information Theory · Computer Science 2023-02-21 Sravan Kumar Ankireddy , S. Ashwin Hebbar , Yihan Jiang , Hyeji Kim , Pramod Viswanath

We consider distributed computations between two parties carried out over a noisy channel that may erase messages. Following a noise model proposed by Dani et al. (2018), the noise level observed by the parties during the computation in our…

Data Structures and Algorithms · Computer Science 2019-09-17 Ran Gelles , Siddharth Iyer

In the binary online (or "causal") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword $\mathbf{x} =(x_1,\ldots,x_n) \in \{0,1\}^n$ bit by bit via a channel limited to at most $pn$…

Information Theory · Computer Science 2014-12-22 Zitan Chen , Sidharth Jaggi , Michael Langberg

We study communication in the presence of a jamming adversary where quadratic power constraints are imposed on the transmitter and the jammer. The jamming signal is allowed to be a function of the codebook, and a noncausal but noisy…

Information Theory · Computer Science 2020-08-11 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi , Anand Sarwate

The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channel's zero-error capacity is zero in the absence of feedback. Moreover, the error-free transmission of a single bit may…

Information Theory · Computer Science 2016-07-11 Annina Bracher , Amos Lapidoth

In this work, we consider linear-feedback schemes for the two-user Gaussian broadcast channel with noiseless feedback. We extend the transmission scheme of [Ozarow and Leung, 1984] by applying estimators with memory instead of the…

Information Theory · Computer Science 2014-12-23 Yonathan Murin , Yonatan Kaspi , Ron Dabora