Publication

Source and channel coding using Fountain codes

Related publications (177)

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.

Rateless Codes for AVC Models

Michael Christoph Gastpar

The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This paper defines a vari ...

2010

Phase Transitions for Mutual Information

Mohammad Amin Shokrollahi, Krishna Kumar, Amir Hesam Salavati, Raj Kumar Krishna Kumar

We consider ensembles of binary linear error correcting codes, obtained by sampling each column of the generator matrix G or parity check matrix H independently from the set of all binary vectors of weight d (of appropriate dimension). We investigate the c ...

IEEE2010

Polar Codes for Q-ary Source Coding

Emre Telatar, Mohammad Karzand

Polar coding is a recent channel coding technique invented by Arikan to achieve the 'symmetric capacity' of binary-input memoryless channels. Subsequently it was observed by Korada and Urbanke that such codes are also good for lossy channel coding, achievi ...

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

Forward error-correcting (FEC) coding and streaming

Mohammad Amin Shokrollahi

In a data decoder for decoding data from received symbols received over a channel from an encoder, a method for decoding data wherein the received data includes erasures and includes source symbols and repair symbols organized into one or more source block ...

2010

Lossless Source Coding with Polar Codes

Satish Babu Korada, Harm Cronie

In this paper lossless compression with polar codes is considered. A polar encoding algorithm is developed and a method to design the code and compute the average compression rate for finite lengths is given. It is shown that the scheme achieves the optima ...

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

Universal a posteriori metrics game

Emmanuel Abbé, Rethnakaran Pulikkoonattu

Over binary input channels, uniform distribution is a universal prior, in the sense that it allows to maximize the worst case mutual information over all binary input channels, ensuring at least 94.2% of the capacity. In this paper, we address a similar qu ...

2010

Transmission of Correlated Information Sources with Network Coding

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

This paper addresses the problem of the distributed delivery of correlated data sources with help of network coding. Network coding provides an alternative to routing algorithms and offers improved system performance, robustness and throughput, with no nee ...

2010

Performance of Rateless Codes under Spatial Coupling

Vahid Aref

Spatial coupling of individual LDPC codes improves the BP threshold of the coupled ensemble to the MAP threshold of the underlying ensemble. In this report, we investigate the performance of spatial coupling on LDGM codes which might lead to constructing a ...

2010

Degraded Multicasting with Network Coding over the Combination Network

Christina Fragouli, Shirin Saeedi Bidokhti

In this paper, we give a characterization of the rate region for the degraded two message set problem, applied to a combination network with erasure channels. We also provide an algorithm that uses topological information in order to deliver the two messag ...

2010

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