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.

Function computation via subspace coding

Christina Fragouli, Lorenzo Keller, Nikhil Karamchandani

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that req ...

2010

Function computation over linear channels

Christina Fragouli, Lorenzo Keller, Nikhil Karamchandani

We consider multiple non-colocated sources commu- nicating over a network to a common sink. We assume that the network operation is fixed, and its end result is to convey a fixed linear deterministic transformation of the source data to the sink. This line ...

2010

A Mobile World of Security

Rüdiger Urbanke, Christina Fragouli, Panagiotis Papadimitratos, Christine Neuberg

Mobile users are increasing fast in numbers, new types of services and applications become available, and new mobile systems (e.g., for intelligent transportation) emerge. Meanwhile, the need for securing communication in such large scale, highly dynamic s ...

2010

Group Secret Key Generation over Broadcast Erasure Channels

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Uday Kiran Pulleti

We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the t ...

2010

On relay placemement for deterministic line network

Christina Fragouli, Emre Atsan

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

2010

Algebraic techniques for deterministic networks

Christina Fragouli, Javad Ebrahimi Boroojeni

We here summarize some recent advances in the study of linear deterministic networks, recently proposed as approximations for wireless channels. This work started by extending the algebraic framework developed for multicasting over graphs in [1] to include ...

2010

Vector Network Coding

Christina Fragouli, Javad Ebrahimi Boroojeni

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...

2010

Network Simplification: the Gaussian N-Relay Diamond Network

Christina Fragouli, Ayfer Özgür Aydin

We consider the Gaussian

N

-relay diamond network, where a source wants to communicate to a destination through a layer of

N

-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only

k

out of the $ ...

2010

Vector Network Coding Algorithms

Christina Fragouli, Javad Ebrahimi Boroojeni

2010

On the benefits of vector network coding

Christina Fragouli, Javad Ebrahimi Boroojeni

In vector network coding, the source multi- casts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L × L coding matrices that play a similar role as coding coeffic ...

2010

Network Simplification: the Gaussian N-Relay Diamond Network

Christina Fragouli, Ayfer Özgür Aydin

We consider the Gaussian

N

-relay diamond network, where a source wants to communicate to a destination through a layer of

N

-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only

k

out of the $ ...

2010