An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures
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.
The addition of a feedback link to a discrete memoryless channel does not increase its capacity, but it does bring with it other benefits. One of these benefits is an increase to the best achievable error exponent. In the first part of this thesis we revis ...
We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns ...
Thanks to the large buffering time of off-line streaming applications, erasure resilient Forward Error Correction (FEC) codes can improve the reliability of communication particularly well. However real-time streaming puts hard restrictions on the buffer s ...
In off-line packetized streaming, rateless forward error correction (FEC) codes spectacularly improve the reliability of transmission over lossy networks. This success relies on time diversity, which in its turn relies on unrestricted buffering time at the ...
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
This paper presents a framework for efficiently streaming scalable video from multiple servers over heterogeneous network paths. We propose to use rateless codes, or Fountain codes, such that each server acts as an independent source, without the need to c ...
This paper addresses the problem of compact representation of a 3D scene, captured by distributed omnidirectional cameras. As the images from the sensors are likely to be correlated in most practical scenarios, we build a distributed algorithm based on cod ...
In off-line streaming, packet level erasure resilient forward error correction (FEC) codes rely on the unrestricted buffering time at the receiver. In real-time streaming, the extremely short playback buffering time makes FEC inefficient for protecting a s ...
Using forward error correction (FEC) in off-line streaming, permitting large buffers, yields spectacular results, but real-time streaming puts hard restrictions on the buffer size and therefore does not allow FEC to deal with long link failures on a single ...
We investigate the problem of collaborative video streaming in overlay networks. We exploit path and source diversity, as well as basic processing capabilities of network nodes in order to increase the overall throughput and improve the video quality at th ...
