Concept

Concatenated error correction code

Related publications (255)

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.

Efficient error correction solutions for OFDM based digital video

Mauro Lattuada

The robustness of the delivery of digital compressed video streams has always been one of the main topic of the standardization bodies to assure the Quality of the Service (QoS). The MPEG standard which is nowadays the reference for digital television defi ...

EPFL2005

Wireless Image Transmission Using Turbo Codes and Optimal Unequal Error Protection

Nikolaos Thomos

A novel image transmission scheme is proposed for the communication of SPIHT image streams over wireless channels. The proposed scheme employs turbo codes and Reed-Solomon codes in order to deal effectively with burst errors. An algorithm for the optimal u ...

Institute of Electrical and Electronics Engineers2005

Unequal Error Protection of Atomic Image Streams

Pascal Frossard, Pierre Vandergheynst

This paper presents an unequal error protection scheme for atomic image bitstreams. An atomic stream is the encoded version of a digital image, which is represented as a sum of bi-dimensional functions, as typically generated by Matching Pursuit encoders. ...

2005

Single and Multi-Hop ARQ in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

We present a novel error-correction scheme for sensor networks called Multi-hop Hybrid ARQ (MHARQ). Rather than immediately discard a received corrupt packet, a node buffers it. When two corrupt versions of a packet have been received, a procedure attempts ...

2005

Improved Decoding of Interleaved AG-Codes

Mohammad Amin Shokrollahi, Lorenz Minder, Andrew Brown

We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the

Q

-ary symmetric channel for large

Q

. We will show that for any

m

and any

\epsilon

the new algorithms can decode up to a fraction of at ...

2005

LDPC codes for fading Gaussian broadcast channels

Peter Allan Berlin, Daniela Tuninetti

In this work, we study coding over a class of two-user broadcast channels (BCs) with additive white Gaussian noise and multiplicative fading known at the receivers only. Joint decoding of low-density parity-check (LDPC) codes is analyzed. The message updat ...

2005

Effect of Interfering Users on the Modulation Order and Code Rate for UWB Impulse-Radio Bit-Interleaved Coded M-ary PPM

Jean-Yves Le Boudec, Ruben Merz

We consider the impact of multi-user interference on a bit-interleaved coded-modulation system with M-ary PPM (BIC M-ary PPM) in an impulse-radio ultra-wideband physical layer. In a realistic scenario such as an ad hoc network, the interference is inherent ...

2005

Locally Testable Codes

Mahdi Cheraghchi Bashi Astaneh

Error correcting codes are combinatorial objects that allow reliable recovery of information in presence of errors by cleverly augmenting the original information with a certain amount of redundancy. The availability of efficient means of error detection i ...

2005

On the universality of Burnashev's error exponent

Emre Telatar, Aslan Tchamkerten

We consider communication over a time-invariant discrete memoryless channel (DMC) with noiseless and instantaneous feedback. We assume that the transmitter and the receiver are not aware of the underlying channel, however, they know that it belongs to some ...

2005

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

2005

Improved Decoding of Interleaved AG-Codes

Mohammad Amin Shokrollahi, Lorenz Minder, Andrew Brown

We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the

Q

-ary symmetric channel for large

Q

. We will show that for any

m

and any

\epsilon

the new algorithms can decode up to a fraction of at ...

2005