Publication

Linear Universal Decoder for Compound Discrete Memoryless Channels

Publications associées (412)

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

Efficient list decoding of Reed-Solomon codes for message recovery in the presence of high noise levels

Mohammad Amin Shokrollahi

A method and apparatus for efficient list decoding of Reed-Solomon error correction codes. A polynomial for a predetermined target list size combining points of an error code applied to a message and points of a received word is determined for a k dimensio ...

2003

An overview of JET edge modelling activities

Richard Pitts, Marco Wischmeier

A number of codes are in use at JET to model the edge plasma. The range of edge codes is described as is the range of physics issues being explored by these codes. The balance between focussed modelling (that looking at particular physics effects) and inte ...

2003

Source-Channel Communication in Sensor Networks

Martin Vetterli, Michael Christoph Gastpar

Sensors acquire data, and communicate this to an interested party. The arising coding problem is often split into two parts: First, the sensors compress their respective acquired signals, potentially applying the concepts of distributed source coding. Then ...

2003

Noisy Text Categorization

Alessandro Vinciarelli

This work presents a system for the categorization of noisy texts. By noisy it is meant any text obtained through an extraction process (affected by errors) from media different than digital texts. We show that, even with an average Word Error Rate of arou ...

IDIAP2003

Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel

Rüdiger Urbanke, Mohammad Amin Shokrollahi

We investigate the average erasure probability of the belief propagation algorithm over the binary erasure channel (BEC) for various finite-length low- density parity-check (LDPC) ensembles. In particular, we give tight upper bounds on the "error floor", i ...

2002

To code or not to code

Michael Christoph Gastpar

It is well known and surprising that the uncoded transmission of an independent and identically distributed Gaussian source across an additive white Gaussian noise channel is optimal: No amount of sophistication in the coding strategy can ever perform bett ...

EPFL2002

Capacity-achieving sequences for the erasure channel

Mohammad Amin Shokrollahi

This paper starts a systematic study of capacity-achieving (c.a.) sequences of low-density parity-check codes for the erasure channel. We introduce a class A of analytic functions and develop a procedure to obtain degree distributions for the codes. We sho ...

2002

An Introduction to Low-Density Parity-Check Codes

Mohammad Amin Shokrollahi

In this paper we will survey some of the most recent results on low-density parity-check codes. Our emphasis will be primarily on the asymptotic theory of these codes. For the most part, we will introduce the main concepts for the easier case of the erasur ...

Springer2002

Potential of chaos communication over noisy channels - Channel coding using chaotic piecewise linear maps

Martin Hasler, Thomas Schimming

The paper gives an information theoretic analysis of the potential of chaos in digital communication schemes, underlining that there is no fundamental principle that speaks against the use of chaotic systems in digital communications. The channel model con ...

2002

Optimal and suboptimal chaos receivers

Martin Hasler, Thomas Schimming

The paper describes the state of the art in the design of receivers for chaos based digital communication over noisy channels. In the first part, an information theoretic analysis of the potential of chaos in digital communication schemes is given, underli ...

2002