Publication

Raptor codes on symmetric channels

Publications associées (37)

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

Online Fountain Codes With Low Overhead

Mohammad Amin Shokrollahi, Yuval Cassuto

An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formaliz ...

Institute of Electrical and Electronics Engineers2015

LDPC Codes for 2D Arrays

Mohammad Amin Shokrollahi, Yuval Cassuto

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...

Institute of Electrical and Electronics Engineers2014

Generalized Codes on Graphs and Applications in Content Distribution

Masoud Alipour Babaei

The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single pariti ...

EPFL2013

Levels-of-Approximation Approach in Codes of Practice

Aurelio Muttoni, Miguel Fernández Ruiz

Civil engineering projects typically involve a number of design phases, such as preliminary design, tender design and executive design. The required degree of accuracy for the analysis of the behaviour and strength of the structural members increases as a ...

2012

Non-contact, 3D magnetic biomanipulation for in vivo and in vitro applications

Mahmut Selman Sakar

Micro/nano robots have the potential to revolutionize many aspects of medicine. These untethered, wirelessly controlled and powered devices will make existing therapeutic and diagnostic procedures less invasive and will enable new procedures never before p ...

IEEE2012

Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional low-density parity-check (LDPC) ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing functions of the average degree. Several variations on the basic theme have been proposed ...

2011

How regular is a regular-interval timetable? From theory to application

Panagiotis Tzieropoulos, Daniel Emery, David Tron

Initially, choice of regular-interval timetable was mostly addressing operational concerns, aiming to increase the network throughput and to smooth the day-today tasks of the personnel. Separation between infrastructure management and train operations, ind ...

Wit Press, Ashurst Lodge, Southampton So40 7Aa, Ashurst, England2010

On the scaling of polar codes: II. The behavior of un-polarized channels

Rüdiger Urbanke, Seyed Hamed Hassani

We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes where transmission takes place over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bha ...

IEEE2010

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

Source and channel coding using Fountain codes

Bertrand Ndzana Ndzana

The invention of Fountain codes is a major advance in the field of error correcting codes. The goal of this work is to study and develop algorithms for source and channel coding using a family of Fountain codes known as Raptor codes. From an asymptotic poi ...

EPFL2009