Publication

Network Coding

Related publications (166)

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.

Scalable Asynchronous Incoherent Optical CDMA [invited]

Camille Sophie Brès

We present and review several aspects of incoherent optical code-division multiple access (OCDMA), focusing on the flexible bandwidth allocation and its potential for future optical networks. We briefly present the various OCDMA approaches, coherent and in ...

2007

Concurrent Direct Network Access for Virtual Machine Monitors

Willy Zwaenepoel, Aravind Menon

This paper presents hardware and software mechanisms to enable concurrent direct network access (CDNA) by operating systems running within a virtual machine monitor. In a conventional virtual machine monitor, each operating system running within a virtual ...

2007

Distributed and Component Oriented Tools for Communication Networks Using Web Services

Sébastien Rumley, Christian Gaumier, Christophe Trefois

Modern communication networks are reaching a high level of complexity. As their global dimensioning and performance evaluation are very hard tasks, a multi-layer approach is generally applied to divide them in smaller problems easier to tackle. Within this ...

ARGESIM2007

Network Coding Fundamentals

Christina Fragouli, Emina Soljanin

Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial addresses the first most natural q ...

2007

Pheromone-based Swarming for Position-less MAVs

Dario Floreano, Jean-Christophe Zufferey, Sabine Hauert, Laurent Winkler

Unlike existing aerial swarm systems, we aim at developing algorithms which do not require global or relative positioning information concerning agents and their neighbors. This alleviates the need for sensors which require calibration, are expensive and h ...

2007

Distributed routing algorithms for sensor networks

Guillermo Barrenetxea Kobas

Recent advances in wireless communications and computing technology are enabling the emergence of low-cost devices that incorporate sensing, processing, and communication functionalities. A large number of these devices are deployed in the field to create ...

EPFL2006

Information flow decomposiiton for network coding

Christina Fragouli, Emina Soljanin

The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...

Institute of Electrical and Electronics Engineers2006

Information Flow Decomposition for Network Coding

Christina Fragouli, Emina Soljanin

2006

Integrity (I) codes: Message Integrity Protection and Authentication over Insecure Channels

Jean-Pierre Hubaux, Mario Cagalj, Srdan Capkun

Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors are possible (e.g., it is possible to change a bit “0” into a bit “1”, but not the contrary), we propose integrity codes (I-codes) for a radio co ...

2006

Precoding for broadcasting with linear network codes

Ali H. Sayed

A technique based on linear precoding is introduced for broadcasting on linear networks. The precoding allows the different message components of a broadcast message to be separated and decoded at the desired sink nodes, thus providing a systematic design ...

2006