Concept

Open mail relay

Related publications (15)

Low Complexity Scheduling and Coding for Wireless Networks

The advent of wireless communication technologies has created a paradigm shift in the accessibility of communication. With it has come an increased demand for throughput, a trend that is likely to increase further in the future. A key aspect of these chall ...

EPFL2015

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

Reconciling Schema Matching Networks Through Crowdsourcing

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Zoltán Miklós

Schema matching is the process of establishing correspondences between the attributes of database schemas for data integration purposes. Although several automatic schema matching tools have been developed, their results are often incomplete or erroneous. ...

2014

Combinatorial algorithms for wireless information flow

Christina Fragouli, Javad Ebrahimi Boroojeni

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

Assoc Computing Machinery2012

Approximation for Problems in Multi-User Information Theory

Soheil Mohajerzefreh

The main goal in network information theory is to identify fundamental limits of communication over networks, and design solutions which perform close to such limits. After several decades of effort, many important problems still do not have a characteriza ...

EPFL2010

On cooperative secrecy for discrete memoryless relay networks

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we consider information-theoretically secure communication between two special nodes ("source" and "destination") in a memoryless network with authenticated relays, where the secrecy is with respect to a class of eavesdroppers. We develop ach ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Gaussian Diamond Network with Adversarial Jammer

Suhas Diggavi, Soheil Mohajerzefreh

In this paper we consider communication from a source to a destination over a wireless network with the help of a set of authenticated relays. We focus on a special ``diamond'' network, where there is no direct link between the source and the destination; ...

2009

On Cooperative Wireless Network Secrecy

Emre Telatar, Suhas Diggavi, Etienne Perron

Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-to-point communication is sought, and hence a fundamental question is whether w ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Structured Superposition for Backhaul Constrained Cellular Uplink

Michael Christoph Gastpar

In this paper, we demonstrate the advantage of the inherent algebraic structure of lattice codes, for the uplink channel of a cellular deployment. The out-of-cell interference is assumed to be symmetric, as in Wyner's model. We employ a new relaying techni ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Combinatorial algorithms for wireless information flow

Christina Fragouli, Aurore Amaudruz

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

2009

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.