Publication

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Publications associées (33)

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

Raptor Codes on Binary Memoryless Symmetric Channels

Mohammad Amin Shokrollahi, Seyed Omid Etesami

In this paper, we will investigate the performance of Raptor codes on arbitrary binary input memoryless symmetric channels (BIMSCs). In doing so, we generalize some of the results that were proved before for the erasure channel. We will generalize the stab ...

2006

Weight Distribution of Low-Density Parity-Check Codes

Rüdiger Urbanke, Changyan Di

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 ...

2006

Analytic Determination of Scaling Parameters

Rüdiger Urbanke, Abdelaziz Amraoui, Andrea Montanari

We show that the finite-length scaling parameters for irregular LDPC codes when used over the binary erasure channel can be computed without resorting to ``covariance evolution''. We provide simple expressions that can be evaluated using solely the degree ...

2006

Finite fields And Error-Correcting Codes

Nelly Burrin

After introducing the concept of finite fields and their properties, we look algebraic constructions of error correcting codes. ...

2006

LDPC codes for fading Gaussian broadcast channels

Peter Allan Berlin, Daniela Tuninetti

In this work, we study coding over a class of two-user broadcast channels (BCs) with additive white Gaussian noise and multiplicative fading known at the receivers only. Joint decoding of low-density parity-check (LDPC) codes is analyzed. The message updat ...

2005

Finite length analysis of LT codes

Mohammad Amin Shokrollahi

This paper provides an efficient method for analyzing the error probability of the belief propagation (BP) decoder applied to LT Codes. Each output symbol is generated independently by sampling from a distribution and adding the input symbols corresponding ...

2004

LDPC codes for Gaussian broadcast channels

Peter Allan Berlin, Daniela Tuninetti

We study coding over a class of two-user broadcast channels with additive white Gaussian noise and fading known at the receivers only. Joint decoding of low-density parity-check codes is analyzed. The message update rule at the mapping node linking the use ...

2004

Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q

Mohammad Amin Shokrollahi

Transmission of packets over computer networks is subject to packet-level errors, which appear as "bursts" of bit-level errors and are not well modeled by memoryless binary channels. A standard scrambling technique is used for transmission of packets by th ...

2004

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

Changyan Di

This thesis addresses the topic of Low-Density Parity-Check (LDPC) code analysis, both asymptotically and for finite block lengths. Since in general it is a difficult problem to analyze individual code instances, ensemble averages are studied by following ...

EPFL2004

Low-delay low-complexity error-correcting codes on sparse graphs

Xiao-Yu Hu

This dissertation presents a systematic exposition on finite-block-length coding theory and practice. We begin with the task of identifying the maximum achievable rates over noisy, finite-block-length constrained channels, referred to as (ε, n)-capacity Cε ...

EPFL2003