Publication

Computational Hardness and Explicit Constructions of Error Correcting Codes

Publications associées (68)

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

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

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

Reduced complexity likelihood approximation for chaotic trajectory segments

Thomas Schimming

Recently, statistically optimal detection methods for communication schemes based on chaos have been developed. The decision criterion is based on the well-known maximum likelihood criterion. Unfortunately, the calculation of the likelihoods is of exponent ...

2000

Using low density parity check codes in the McEliece cryptosystem

Mohammad Amin Shokrollahi, Joachim Rosenthal

We examine the implications of using a low density parity check code (LDPCC) in place of the usual Goppa code in McEliece's cryptosystem. Using a LDPCC allows for larger block lengths and the possibility of a combined error correction/encryption protocol ...

2000

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

This work is concerned with the computational complexity of the recognition of

\mbox{LP}_2

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Several subclasses of

\mbox{LP}_2

of particular interest ...

IDIAP1996

Simple algorithms for BCH decoding

Martin Vetterli

Proposes some simple algorithms for decoding BCH codes. The authors show that the pruned FFT is an effective method for evaluating syndromes and for finding the roots of error-locator polynomials. They show that a simple variation of the basic Gaussian eli ...

1995

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

This work is concerned with the computational complexity of the recognition of

\mbox{LP}_2

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Several subclasses of

\mbox{LP}_2

of particular interest ...

IDIAP1996