Concept

Canal binaire symétrique

Publications associées (176)

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

A family of non-binary TLDPC codes: density evolution, convergence and thresholds

We generalize the results about how to compute iterative decoding thresholds over the binary erasure channel of non-binary LDPC code ensembles of [16] to non-binary TLDPC codes [2], [3]. We show in this case how density evolution can be performed in order ...

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

Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel

Nicolas Macris, Satish Babu Korada, Shrinivas Kudekar

We consider communication over a binary erasure channel with low density parity check codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code ensembles, in the asymptotic li ...

2007

The case for structured random codes in network communication theorems

Michael Christoph Gastpar

In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits' and these bits are reliably communicated across the noisy channels. Random codin ...

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

Separation theorems and partial orderings for sensor network problems

Michael Christoph Gastpar

In the absence of complexity and delay constraints, the quality of a noisy communication channel can be characterized by a single number, called its capacity and usually measured in bits. Shannon [1] showed that this number is universal in the sense that v ...

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

On the concentration of the capacity for a code division multiple access system

Nicolas Macris, Satish Babu Korada

We prove the concentration of the capacity, in the large system limit, for a code division multiple access system over an additive white Gaussian noise channel, with Gaussian signature sequences and {\it binary input} symbols. The probabilistic tools that ...

2007

Finite-Length Scaling For Gallager A

Rüdiger Urbanke, Jérémie Ezri

We consider LDPC codes, transmission over the binary symmetric channel (BSC), and decoding using Gallager's algorithm A. For those ensembles whose threshold is determined by the behavior of the algorithm at the beginning of the decoding process we derive a ...

2006

Fountain Codes for the Slepian-Wolf Problem

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The ...

2006

The Kaspi Rate-Distortion Problem with Encoder Side-Information: Binary Erasure Case

Emre Telatar, Suhas Diggavi, Etienne Perron

We consider the problem of compressing a binary symmetric i.i.d. source stream for two decoders, one of which has access to side-information. Kaspi found the rate-distortion tradeoff for this problem for general discrete memoryless sources for the two case ...

2006

On the use of training sequences for channel estimation

Emre Telatar, Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. We study a scenario where communication is carried by first testing the channel by means of a training ...

2006

Asymptotic and finite-length optimization of LDPC codes

Abdelaziz Amraoui

This thesis addresses the problem of information transmission over noisy channels. In 1993, Berrou, Glavieux and Thitimajshima discovered Turbo-codes. These codes made it possible to achieve a very good performance at low decoding complexity. In hindsight, ...

EPFL2006