Concept

Code linéaire

Publications associées (207)

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

Embedded Rank Distance Codes for ISI channels

Suhas Diggavi, Sanket Dusad

Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matric ...

2008

Cryptanalysis of an E0-like Combiner with Memory

Serge Vaudenay, Yi Lu

In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output sequences (up to certain bits). An upper bound of the correlations is given, wh ...

2008

On communication over discrete memoryless channels with noiseless feedback

Peter Allan Berlin

The addition of a feedback link to a discrete memoryless channel does not increase its capacity, but it does bring with it other benefits. One of these benefits is an increase to the best achievable error exponent. In the first part of this thesis we revis ...

EPFL2008

Decay of Correlations: An Application to Low-Density Parity Check codes

Nicolas Macris, Shrinivas Kudekar

Recently the decay of correlations between bits of low density generator matrix (LDGM) codes have been investigated by using high temperature expansions from statistical physics \cite{KuMa07}. In this work we apply these ideas to a special class of low den ...

IEEE2008

Proof of replica formulas in the high noise regime for communication using LDGM codes

Nicolas Macris, Shrinivas Kudekar

We consider communication over a binary input memoryless output symmetric channel with low density generator matrix codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code e ...

2008

Proof of replica formulas in the high noise regime for communication using LDGM codes

Nicolas Macris, Shrinivas Kudekar

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

Network coding for dynamically changing networks

Christina Fragouli

We here advocate the case for network coding as a guiding paradigm for the operation of networks that vary in a small time frame, due to node mobility, channel variations, and varying traffic conditions. Three ideas that appeared succesively in time brough ...

2008

Exchange of Limits: Why Iterative Decoding Works

Rüdiger Urbanke, Satish Babu Korada

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes under MP decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given by density e ...

2008

Non-binary LDPC codes and EXIT like functions

In the first part of this thesis we are interested in the asymptotic performance analysis of Non-Binary Low-Density Parity-Check (NBLDPC) codes over the Binary Erasure Channel (BEC) decoded via the suboptimal Belief Propagation (BP) decoder as well as the ...

EPFL2008

Extending Peer-to-Peer Networks for Approximate Search

Ion Constantinescu, Michael Ignaz Schumacher, Roman Schmidt, Alain Mowat

Peer-to-Peer (P2P) networks are used worldwide for many applications such as file sharing or news servers. There are many different implementations available, each with its pros and cons. In this paper, we propose a way to enable approximate queries in a P ...

2008