English
Related papers

Related papers: The Arbitrarily Varying Broadcast Channel with Deg…

200 papers

This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…

Information Theory · Computer Science 2009-11-04 Ramy H. Gohary , Timothy N. Davidson

Problems dealing with the ability to take an action that affects the states of state-dependent communication channels are of timely interest and importance. Therefore, we extend the study of action-dependent channels, which until now…

Information Theory · Computer Science 2016-11-18 Lior Dikstein , Haim H. Permuter , Shlomo Shamai

We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN)…

Information Theory · Computer Science 2012-03-30 Mojtaba Rahmati , Tolga M. Duman

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

Action-dependent channels model scenarios in which transmission takes place in two successive phases. In the first phase, the encoder selects an "action" sequence, with the twofold aim of conveying information to the receiver and of…

Information Theory · Computer Science 2012-07-24 Behzad Ahmadi , Osvaldo Simeone

We examine deterministic broadcasting on multiple-access channels for a scenario when packets are injected continuously by an adversary to the buffers of the devices at rate $\rho$ packages per round. The aim is to maintain system…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-19 Elijah Hradovich , Marek Klonowski , Dariusz R. Kowalski

We study the content delivery problem between a transmitter and two receivers through erasure links, when each receiver has access to some random side-information about the files requested by the other user. The random side-information is…

Information Theory · Computer Science 2021-11-18 Alireza Vahid , Shih-Chun Lin , I-Hsiang Wang , Yi-Chun Lai

A joint communication and channel state estimation problem is investigated, in which reliable information transmission over a noisy channel, and high-fidelity estimation of the channel state, are simultaneously sought. The tradeoff between…

Information Theory · Computer Science 2008-01-09 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

An arbitrarily varying wiretap channel (AVWTC) with a type constraint on the allowed state sequences is considered, and a single-letter characterization of its correlated-random (CR) assisted semantic-security (SS) capacity is derived. The…

Information Theory · Computer Science 2016-10-19 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

The paper provides a new perspective on peak- and average-constrained Gaussian channels. Such channels model optical wireless communication (OWC) systems which employ intensity-modulation with direct detection (IM/DD). First, the paper…

Information Theory · Computer Science 2023-03-20 Sarah Bahanshal , Ahmad Abdel-Qader , Anas Chaaban

Advancing over up-to-date information theoretic results that assume symmetric correlation models, in this work we consider the problem of lossy binary source coding with side information, where the correlation is expressed by a generic…

Information Theory · Computer Science 2016-11-17 Andrei Sechelea , Samuel Cheng , Adrian Munteanu , Nikos Deligiannis

The Wyner-Ahlswede-K\"orner (WAK) empirical-coordination problem where the encoders cooperate via a finite-capacity one-sided link is considered. The coordination-capacity region is derived by combining several source coding techniques,…

Information Theory · Computer Science 2016-11-18 Ziv Goldfeld , Haim H. Permuter , Gerhard Kramer

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

Information Theory · Computer Science 2008-04-25 Chandra Nair , Vincent Wang Zizhou

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random…

Information Theory · Computer Science 2016-11-15 Nariman Farsad , Yonathan Murin , Andrew Eckford , Andrea Goldsmith

A scenario involving a source, a channel, and a destination, where the destination is interested in {\em both} reliably reconstructing the message transmitted by the source and estimating with a fidelity criterion the state of the channel,…

Information Theory · Computer Science 2011-08-30 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that…

Information Theory · Computer Science 2011-05-31 Amin Aminzadeh Gohari , Shenghao Yang , Sidharth Jaggi

We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DMC) with i.i.d. states. The encoder takes probing actions…

Information Theory · Computer Science 2016-11-15 Himanshu Asnani , Haim Permuter , Tsachy Weissman

This paper addresses the problem of distributed state estimation via multiple access channels (MACs). We consider a scenario where two encoders are simultaneously communicating their measurements through a noisy channel. Firstly, the…

Systems and Control · Electrical Eng. & Systems 2022-12-23 Ghassen Zafzouf , Girish N. Nair , Farhad Farokhi

This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the…

Information Theory · Computer Science 2015-02-26 Ronit Bustin , Rafael F. Schaefer , H. Vincent Poor , Shlomo Shamai

In this paper, we introduce the notion of Plausible Deniability in an information theoretic framework. We consider a scenario where an entity that eavesdrops through a broadcast channel summons one of the parties in a communication protocol…

Information Theory · Computer Science 2017-05-16 Mayank Bakshi , Vinod Prabhakaran
‹ Prev 1 8 9 10 Next ›