Concept

Hamming code

Related publications (226)

Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes

Consider communication over a binary-input memoryless output-symmetric channel with low-density parity-check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic formula for the aver ...

2009

Decay of Correlations in Low Density Parity Check Codes: Low Noise Regime

Nicolas Macris, Shrinivas Kudekar

Consider transmission over a binary additive white gaussian noise channel using a fixed low-density parity check code. We consider the posterior measure over the code bits and the corresponding correlation between two codebits, averaged over the noise real ...

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

Decay of Correlations in Low Density Parity Check Codes: Low Noise Regime

Nicolas Macris, Shrinivas Kudekar

2009

Low-Density Codes Based on Chaotic Systems for Low-Density Codes Based on Chaotic Systems for Simple Encoding

Martin Hasler, Slobodan Kozic

This paper proposes a new class of low-density generator-matrix codes (LDGM) based on chaotic dynamical systems. The codes are designed by controlling symbolic dynamics and using linear convolutional codes. Analyzing the complex structure of chaotic system ...

2009

Network coding for undirected information exchange

Christina Fragouli, Suhas Diggavi

We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achie ...

2009

Linear Universal Decoder for Compound Discrete Memoryless Channels

Rethnakaran Pulikkoonattu

Shannon in his seminal work \cite{paper:shannon} formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity \textit{channel capacity} ...

2009

Polar codes for channel and source coding

Satish Babu Korada

The two central topics of information theory are the compression and the transmission of data. Shannon, in his seminal work, formalized both these problems and determined their fundamental limits. Since then the main goal of coding theory has been to find ...

EPFL2009

A critical examination of the size effect correction for welded steel tubular joints

Alain Nussbaumer, Luís Costa Borges, Ann Schumacher

Welded circular hollow section (CHS) joints typical to bridge construction have been examined in an experimental, numerical, and analytical study with respect to their fatigue strength. Evidence from this study has indicated lower fatigue strength for join ...

2009

Source and channel coding using Fountain codes

Bertrand Ndzana Ndzana

The invention of Fountain codes is a major advance in the field of error correcting codes. The goal of this work is to study and develop algorithms for source and channel coding using a family of Fountain codes known as Raptor codes. From an asymptotic poi ...

EPFL2009

Beamforming with a Maximum Negentropy Criterion

Philip Neil Garner, Weifeng Li

In this paper, we address a beamforming application based on the capture of far-field speech data from a single speaker in a real meeting room. After the position of the speaker is estimated by a speaker tracking system, we construct a subband-domain beamf ...

2009

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.