Publication

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

Publications associées (155)

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

List-Decoding Algorithms

The goal of this project is to present the main list-decoding algorithms for Reed-Solomon codes, implement them and study more specifically some of their properties and possible improvements. ...

2006

Maximum Rank Distance (MRD) Codes for ISI channels

Suhas Diggavi, Sanket Dusad

In this report we construct maximal rate binary MRD codes for ISI channel. We can then subsequently characterise the rate diversity tradeoff for ISI channel. ...

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

Wireless Image Transmission Using Turbo Codes and Optimal Unequal Error Protection

Nikolaos Thomos

A novel image transmission scheme is proposed for the communication of SPIHT image streams over wireless channels. The proposed scheme employs turbo codes and Reed-Solomon codes in order to deal effectively with burst errors. An algorithm for the optimal u ...

Institute of Electrical and Electronics Engineers2005

Improved Decoding of Interleaved AG-Codes

Mohammad Amin Shokrollahi, Lorenz Minder, Andrew Brown

We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the

Q

-ary symmetric channel for large

Q

. We will show that for any

m

and any

\epsilon

the new algorithms can decode up to a fraction of at ...

2005

On Cascaded Channels with Finite Complexity Processing at Intermediate Nodes

Christina Fragouli, Urs Niesen

We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fix ...

2005

Index Assignment for N Balanced Multiple Description Scalar Quantization

Pascal Frossard, Ivana Radulovic

In this paper, we address the design of any number of balanced multiple descriptions using the multiple description scalar quantization(MDSQ) technique. The proposed scheme has the advantages of low complexity, the possibility of being extended easily to a ...

2005

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

Capacity-approaching codes on the q-ary symmetric channel for large q

Mohammad Amin Shokrollahi

We give a short survey of several techniques to construct codes on GF(q) that approach the capacity of the q-ary symmetric channel. The q-ary symmetric channel represents the next level of difficulty after the binary erasure channel (BEC). Since the channe ...

2004

Concatenated codes for block-fading channels

Albert Guillén i Fàbregas

In this thesis we study coding strategies for single-user block-fading channels. The block-fading channel is a simplified model of slowly varying wireless communication channels with stringent delay constraints. This model is particularly important in prac ...

EPFL2004

Improved Decoding of Interleaved AG-Codes

Mohammad Amin Shokrollahi, Lorenz Minder, Andrew Brown

We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the

Q

-ary symmetric channel for large

Q

. We will show that for any

m

and any

\epsilon

the new algorithms can decode up to a fraction of at ...

2005