Publication

On the Capacity of Large Gaussian Relay Networks

Publications associées (40)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Iterative Coding for Network Coding

Rüdiger Urbanke, Andrea Montanari

We consider communication over a noisy network under randomized linear network coding. Possible error mechanisms include node-or link-failures, Byzantine behavior of nodes, or an overestimate of the network min-cut. Building on the work of Kotter and Kschi ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Building Wireless Network Coding Protocols

Lorenzo Keller

This work studies how to build wireless network protocols that achieve better reliability, lower delay and higher throughput than existing alternatives by using network coding and by exploiting the broadcast nature of the wireless channel. In the first par ...

EPFL2012

Expected loss bounds for authentication in constrained channels

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

We derive bounds on the expected loss for authenti-cation protocols in channels which are constrained due to noisyconditions and communication costs. This is motivated by anumber of authentication protocols, where at least some partof the authentication is ...

Ieee2012

Network Coding: Beyond Throughput Benefits

Christina Fragouli

Network coding enables novel network functionalities and thus offers a wider canvas of choices when optimizing an information flow problem. In this paper, we examine the simplest possible information flow problem, a unicast connection, and explore what we ...

2011

Asymmetric Multilevel Diversity Coding and Asymmetric Gaussian Multiple Descriptions

Suhas Diggavi

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of 2(K) - 1 information sources, ordered in a decreasing level of importance, is encoded into K messages (or descriptions). There are 2(K) - 1 decoders, each of which has a ...

2010

A Deterministic Approach to Wireless Network Error Correction

Suhas Diggavi

In this paper we consider communication between two special nodes ("source" and "destination") in a wireless relay network, which has malfunctioning or malicious nodes (inserting errors). We develop the model for wireless network communication in the prese ...

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

Efficient Broadcasting Using Network Coding

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We consider the problem of broadcasting in an ad-hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless netwo ...

2008

Low-complexity Algorithms for Energy Efficient Broadcasting in Wireless Networks

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless net- ...

2008

The case for structured random codes in network capacity theorems

Michael Christoph Gastpar

Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding arguments, such as ran ...

2008

Network coding for dynamically changing networks

Christina Fragouli

We here advocate the case for network coding as a guiding paradigm for the operation of networks that vary in a small time frame, due to node mobility, channel variations, and varying traffic conditions. Three ideas that appeared succesively in time brough ...

2008