Publication

Analysis of the Second Moment of the LT Decoder

Publications associées (35)

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

Polar Codes For Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Building on polar code constructions proposed by the authors for deterministic broadcast channels, two theorems are introduced in the present paper for noisy two-user broadcast channels. The theorems establish polar code constructions for two important ...

2013

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization

Rüdiger Urbanke, Seyed Hamed Hassani

We consider the asymptotic behavior of the polarization process in the large block-length regime when transmission takes place over a binary-input memoryless symmetric channel W. In particular, we study the asymptotics of the cumulative distribution, P(Z(n ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Growth Codes: Intermediate Performance Analysis and Application to Video

Pascal Frossard, Nikolaos Thomos, Rethnakaran Pulikkoonattu

Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly usef ...

Institute of Electrical and Electronics Engineers2013

Soft control of swarms: Analytical approach

Max-Olivier Hongler, Guillaume Adrien Sartoretti

We analytically study the collective dynamics of mutually interacting heterogeneous agents evolving in a random environment. Our formal framework consists of a collection of JV scalar drifted Brownian motions (BM) diffusing on R. The mutual interactions ar ...

2013

Polar Codes: Finite Length Implementation, Error Correlations and Multilevel Modulation

Shannon, in his seminal work, formalized the transmission of data over a communication channel and determined its fundamental limits. He characterized the relation between communication rate and error probability and showed that as long as the communicatio ...

2012

Degree Distribution Optimization in Raptor Network Coding

Pascal Frossard, Nikolaos Thomos

We consider a multi-source delivery system, where Raptor coding at sources and linear network coding in overlay nodes work in concert for efficient data delivery in networks with diversity. Such a combination permits to increase throughput and loss resilie ...

2011

Raptor Codes

Mohammad Amin Shokrollahi

This monograph describes the theory behind Raptor codes, and elucidates elements of the processes behind the design of two of the most prominent members of this class of codes: R10 and RaptorQ (RQ). R10 has already been adopted by a number of standards' bo ...

2011

Rateless Codes for AVC Models

Michael Christoph Gastpar

The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This paper defines a vari ...

2010

Analysis of the Second Moment of the LT Decoder

Mohammad Amin Shokrollahi, Ghid Maatouk

We analyze the second moment of the ripple size during the LT decoding process and prove that the standard deviation of the ripple size for an LT-code with length k is of the order of root k. Together with a result by Karp et. al (2004) stating that the ex ...

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