Publication

Asymptotic and finite-length analysis of low-density parity-check codes

Publications associées (268)

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

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

Efficient Implementation of Linear Programming Decoding

Mohammad Amin Shokrollahi

While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the large size of the r ...

2011

Universal Rateless Codes From Coupled LT Codes

Rüdiger Urbanke, Vahid Aref

It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We study the performanc ...

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

Distributed sensor failure detection in sensor networks

Pascal Frossard, Nikolaos Thomos, Tamara Tosic

We investigate the problem of distributed sensors' failure detection in networks with a small number of defective sensors, whose measurements differ significantly from neighboring sensor measurements. Defective sensors are represented by non-zero values in ...

2011

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

Mohammad Amin Shokrollahi, Yuval Cassuto

Probabilistic construction of codes on two-dimensional arrays is proposed and analyzed. Instead of a pure combinatorial erasure model used in traditional array codes, we propose a mixed combinatorial-probabilistic model of limiting the number of column fai ...

IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Practical code design for compute-and-forward

Michael Christoph Gastpar

The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of ...

IEEE2011

Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional LDPC ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing as a function of the average degree. Several variations on the basic theme have been proposed to date, all of which s ...

IEEE2010

Phase Transitions for Mutual Information

Mohammad Amin Shokrollahi, Krishna Kumar, Amir Hesam Salavati, Raj Kumar Krishna Kumar

We consider ensembles of binary linear error correcting codes, obtained by sampling each column of the generator matrix G or parity check matrix H independently from the set of all binary vectors of weight d (of appropriate dimension). We investigate the c ...

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

Block copolymers and uses thereof

Jeffrey Alan Hubbell, Melody Swartz, Conlin O'Neil

An encoding/decoding apparatus and method using a low-density parity-check code (LDPC code) is disclosed. Basic column group information, serving as a set of information regarding positions of rows with weight 1, is extracted from a reference column in eac ...

2010