Publications by Christina Fragouli

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.

Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the en ...

Our goal, in this paper, is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition ...

We consider a group of mobile users, within proximity of each other, who are interested in watching the same online video. The common practice today is that each user downloads the video independently on her mobile device using her own cellular connection, ...

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose codi ...

Network Monitoring is a challenging problem that has received a lot of attention in the Internet community, particularly in the context of overlay networks. Independently, recent advances in Network Coding have shown that it is possible to increase network ...

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 ...

Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the ...

A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts t ...

We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a ﬁnite ﬁeld F_q ) from one of the hones ...

Designing a communication protocol for sensor networks often involves obtaining the right trade-off between energy efficiency and end-to-end packet error rate. In this article, we show that network coding provides a means to elegantly balance these two goa ...

In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, a ...

We consider communication of two degraded mes- sage sets over graphs where a common source sends two prioritized messages (a common and a private message) to several receivers. All receivers require the common message and a subset of the receivers require ...

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedba ...

Communication complexity---the minimum amount of communication required---of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and ...

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 ...

We want to enable a pair of communicating users to exchange secret messages while hiding the fact that secret communication is taking place. We propose a linguistic steganography approach, where each human message is hidden in another human-like message. A ...

We consider single-hop broadcast packet erasure channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in [1], which were ...

We consider a unicast communication problem where, a source transmits information to a destination through a wireless network with the help of k relays positioned on a line. We adopt the linear deterministic model to capture the wireless signal interaction ...

Christina Fragouli

Chat with Graph Search

Loss Tomography in General Topologies with Network Coding

Active topology inference using network coding

MicroCast: Cooperative Video Streaming Using Cellular and Local Connections

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Coding Schemes for Line Networks

A Network Coding Approach to Network Monitoring (Invited Paper)

Pliable Index Coding

Broadcasting Private Messages Securely

Combinatorial algorithms for wireless information flow

Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

SenseCode: Network Coding for Reliable Sensor Networks

Compressed network coding vectors

Degraded two-message multicast over graphs

Simple schedules for half-duplex networks

Securing Broadcast Against Dishonest Receivers

Silence-Based Communication

System and method for cooperative data streaming

Matryoshka: Hiding Secret Communication in Plain Sight

Feedback-based Coding Algorithms for Braodcast Erasure Channels with Degraded Message Sets

On Relay Placement for Deterministic Line Networks