English
Related papers

Related papers: Erasure Broadcast Channels with Intermittent Feedb…

200 papers

This paper studies a layered erasure model for two-user interference channels, which can be viewed as a simplified version of Gaussian fading interference channel. It is assumed that channel state information~(CSI) is only available at…

Information Theory · Computer Science 2016-01-26 Yan Zhu

We study the capacity region of two-user erasure interference channels with local delayed channel state information at the transmitters. In our model, transmitters have local mismatched outdated knowledge of the channel gains. We propose a…

Information Theory · Computer Science 2016-07-26 Alireza Vahid , Robert Calderbank

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Outer and inner bounds on the capacity region are derived when the…

Information Theory · Computer Science 2014-11-11 Michael Heindlmaier , Navid Reyhanian , Shirin Saeedi Bidokhti

We study the effects of introducing a feedback channel in the two-receiver erasure source-broadcast problem in which a binary equiprobable source is to be sent over an erasure broadcast channel to two receivers subject to erasure distortion…

Information Theory · Computer Science 2021-05-04 Louis Tan , Kaveh Mahdaviani , Ashish Khisti

We consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally…

Information Theory · Computer Science 2014-06-16 A. Papadopoulos , L. Georgiadis

Jolfaei et al. used feedback to create transmit signals that are simultaneously useful for multiple users in a broadcast channel. Later, Georgiadis and Tassiulas studied erasure broadcast channels with feedback, and presented the capacity…

Information Theory · Computer Science 2020-05-19 Alireza Vahid , Shih-Chun Lin , I-Hsiang Wang

We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of…

Information Theory · Computer Science 2019-05-17 Quan Geng , Hieu T. Do , Rui Wu , Mindi Yuan , Yun Li , Wei Ding

This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the…

Information Theory · Computer Science 2009-11-06 Yan Zhu , Dongning Guo

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

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…

Information Theory · Computer Science 2015-06-25 Michael Heindlmaier , Shirin Saeedi Bidokhti

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Two scenarios are considered: (i) when the transmitter has causal…

Information Theory · Computer Science 2018-02-21 Michael Heindlmaier , Shirin Saeedi Bidokhti

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

To study the effect of lack of up-to-date channel state information at the transmitters (CSIT), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under…

Information Theory · Computer Science 2016-11-17 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…

Information Theory · Computer Science 2020-04-22 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

This paper considers packet scheduling over a broadcast channel with packet erasures to multiple receivers with different messages (multiple uni-cast) each with possibly different hard deadline constraints. A novel metric is proposed and…

Networking and Internet Architecture · Computer Science 2018-08-01 Zohreh Ovaisi , Natasha Devroye , Hulya Seferoglu , Besma Smida , Daniela Tuninetti

In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via…

Information Theory · Computer Science 2016-03-24 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

We consider the $N$-user broadcast erasure channel with $N$ unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the…

Information Theory · Computer Science 2016-11-17 Marios Gatzianas , Leonidas Georgiadis , Leandros Tassiulas

In this paper, the capacity region of the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF) available at the transmitter is investigated. The LPE-BC is a high-SNR approximation of the fading Gaussian BC…

Information Theory · Computer Science 2019-01-08 Siyao Li , Daniela Tuninetti , Natasha Devroye

We formulate and study a cryptographic problem relevant to wireless: a sender, Alice, wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob…

Information Theory · Computer Science 2011-10-27 László Czap , Vinod M. Prabhakaran , Suhas Diggavi , Christina Fragouli

This work considers the smart repeater network where a single source $s$ wants to send two independent packet streams to destinations $\{d_1,d_2\}$ with the help of relay $r$. The transmission from $s$ or $r$ is modeled by packet erasure…

Information Theory · Computer Science 2016-05-05 Jaemin Han , Chih-Chun Wang
‹ Prev 1 2 3 10 Next ›