Publication

Broadcasting and Multicasting Nested Message Sets

Related publications (124)

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.

Performance Evaluation of a Multi-band UWB Location and Communication System Based on Modified Gegenbauer Functions

Ultra wide band (UWB) may offer very efficient solutions for various communication and sensing applications. Two approaches have emerged, which meet all the communication requirements: impulse and multi-band systems. The present work is concerned in the se ...

Springer Verlag2009

MIMO Compute-and-Forward

Michael Christoph Gastpar

In many network communication scenarios, a relay in the network may only need to recover and retransmit an equation of the transmitted messages. In previous work, it has been shown that if each transmitter employs the same lattice code, the interference st ...

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

Randomized network coding for UEP video delivery in overlay networks

Pascal Frossard, Nikolaos Thomos

This paper presents a receiver-driven video delivery algorithm that exploits a novel Randomized Network Coding (RNC) scheme for unequal error protection (UEP). The main idea of our approach is to account for the unequal importance of media packets in the n ...

2009

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009

Scalable Multicasting in One-Pump Parametric Amplifier

Camille Sophie Brès

We report the experimental demonstration of all-optical wavelength multicasting of OC-768 (40 Gbps) channel using a single-pass, pump modulated parametric amplifier. The performances of 1-to-20 and 1-to-40 multicasting with excellent signal fidelity we ...

Institute of Electrical and Electronics Engineers2009

On degraded two-message set broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case wher ...

2009

GSN, Middleware for Streaming World (Best Demo Award)

Karl Aberer, Sebastian Michel, Ali Salehi, Mehdi Riahi

In this paper we present the Global Sensor Networks (gsn.sf.net) and the NexTick (nextick.org) projects. ...

2009

Network Resource Allocation for Competing Multiple Description Transmissions

Suhas Diggavi

Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (mult ...

2008

Achievable Flows on Orthogonal Information Networks

Dinkar Vasudevan

We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...

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

Local Interference Can Accelerate Gossip Algorithms

Michael Christoph Gastpar

In this paper we show how interference can be exploited to perform gossip computations over a larger local neighborhood, rather than only pairs of nodes. We use a recently introduced technique called computation coding to perform reliable computation over ...

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

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009