Person

Christina Fragouli

This person is no longer with EPFL

Related publications (178)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

System and method for cooperative data streaming

Christina Fragouli, Lorenzo Keller

A system and method for cooperative data streaming are disclosed. According to one embodiment, a system for cooperative data streaming comprises a group of devices comprising at least two devices, which are interested in obtaining the same content from the ...

2015

Secure Network Coding With Erasures and Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this pa ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Pliable Index Coding

Christina Fragouli, Siddhartha Brahma

We formulate a new variant of the index coding problem, where instead of demanding a specific message, clients are pliable, and are interested in receiving any t messages that they do not have. We term this problem pliable index coding or PICOD(t). We prov ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Efficient Subnetwork Selection in Relay Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a source that would like to communicate with a destination over a layered Gaussian relay network. We present a computationally efficient method that enables to select a near-optimal (in terms of throughput) subnetwork of a given size connecting ...

2014

Wireless Network Simplification: The Gaussian N-Relay Diamond Network

Christina Fragouli

We consider the Gaussian N-relay diamond network, where a source wants to communicate to destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain using only k out of the N avail ...

Institute of Electrical and Electronics Engineers2014

Cooperative Relaying at Finite SNR-Role of Quantize-Map-and-Forward

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

This paper contributes to the design and analysis of Quantize-Map-and-Forward (QMF) relaying by optimizing its performance for small relay networks. QMF was proved to achieve the capacity of arbitrary networks within a bounded gap, as well as the optimal d ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Efficient Subnetwork Selection in Relay Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

Ieee2014

Switched Local Schedules for Diamond Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a Gaussian diamond network where a source communicates with the destination through

n

non-interfering half-duplex relays. We focus on half-duplex schedules that utilize only local channel state information, i.e., each relay has access to its ...

2014

Structure of optimal schedules in diamond networks

Christina Fragouli, Siddhartha Brahma

We consider Gaussian diamond networks with n half-duplex relays. At any point of time, a relay can either be in a listening (L) or transmitting (T) state. The capacity of such networks can be approximated to within a constant gap (independent of channel SN ...

Ieee2014

A simple relaying strategy for diamond networks

Christina Fragouli, Siddhartha Brahma

We consider a Gaussian diamond network where a source communicates with the destination through n non-interfering half-duplex relays. Using simple approximations to the capacity of the network, we show that simple relaying strategies involving two relays a ...

Ieee2014

Switched Local Schedules for Diamond Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a Gaussian diamond network where a source communicates with the destination through

n

non-interfering half-duplex relays. We focus on half-duplex schedules that utilize only local channel state information, i.e., each relay has access to its ...

2014