Concept

Fountain code

Publications associées (122)

Code Construction for Multiple Sources Network Coding

In several wireless applications multiple sources transmit information to one or more receivers, many times over unknown topologies. This is especially so in mobile networks where learning the topology may have prohibitive complexity. Network coding techni ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2009

Media coding for streaming in networks with source and path diversity

Pascal Frossard, Nikolaos Thomos

Novel network architectures such as overlay networks offer significant diversity that can compensate for the lack of strict quality of service in today's communication infrastructures. In order to take advantage of this diversity for delay-sensitive media ...

Springer-Verlag2009

Channel Coding for Progressive Images in a 2-D Time-Frequency OFDM Block With Channel Estimation Errors

Laura Toni

Coding and diversity are very effective techniques for improving transmission reliability in a mobile wireless environ- ment. The use of diversity is particularly important for multimedia communications over fading channels. In this work, we study the tran ...

Institute of Electrical and Electronics Engineers2009

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

Network coding: from theory to media streaming

Pascal Frossard, Nikolaos Thomos

Network coding has recently emerged as an alternative to traditional routing algorithms in communication systems. In network coding, the network nodes can combine the packets they receive before forwarding them to the neighbouring nodes. Intensive research ...

2009

Network coding: from theory to media streaming

Pascal Frossard, Nikolaos Thomos

2009

Concentration of Magnetization for Linear Block Codes

Nicolas Macris, Satish Babu Korada, Shrinivas Kudekar

We consider communication over the binary erasure and the binary additive white gaussian noise channels using fixed linear block codes and also appropriate ensembles of such codes. We show concentration of the magnetization over the channel realizations an ...

2008

Optimistic Erasure Coded Distributed Storage

Rachid Guerraoui, Ron Levy, Partha Dutta

Erasure coded storage provides a cheap and space efficient way to tolerate failures through the use of networked commodity servers. Erasure coded data is kept on n different servers out of which f can fail. By combining encoded blocks from n-f servers, the ...

2008

Application Layer Forward Error Correction for Mobile Multimedia Broadcasting

Mohammad Amin Shokrollahi

Application Layer Forward Error Correction (AL-FEC) is an innovative way to provide reliability in mobile broadcast systems. Conventional data such as multimedia files or multimedia streams are extended with repair information which can be used to recover ...

CRC Press2008

Fountain codes for piecewise stationary channels

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...

IEEE2008

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