Publication

Fountain Codes for the Slepian-Wolf Problem

Related publications (37)

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.

Extremal Channels of Gallager's E-0 Under the Basic Polarization Transformations

Mine Alsan

We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager's reliability function E-0 of binary input discrete memoryless channels evaluated under the uniform input distribution from the aspect of channel polarizat ...

Institute of Electrical and Electronics Engineers2014

LDPC Codes for 2D Arrays

Mohammad Amin Shokrollahi, Yuval Cassuto

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...

Institute of Electrical and Electronics Engineers2014

Torsion homology of arithmetic lattices and K-2 of imaginary fields

Vincent Emery

Let be a symmetric space of noncompact type. A result of Gelander provides exponential upper bounds in terms of the volume for the torsion homology of the noncompact arithmetic locally symmetric spaces . We show that under suitable assumptions on this resu ...

Springer Heidelberg2014

Generalized Codes on Graphs and Applications in Content Distribution

Masoud Alipour Babaei

The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single pariti ...

EPFL2013

On the Convergence Speed of Spatially Coupled LDPC Ensembles

Vahid Aref

Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying non-coupled ensemb ...

2013

Scaling Exponent of List Decoders with Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...

Ieee2013

Symmetric vs. asymmetric squaraines as photosensitisers in mesoscopic injection solar cells: a structure-property relationship study

Michael Graetzel, Mohammad Khaja Nazeeruddin, Davide Di Censo, Guido Viscardi

A symmetric squaraine and its related non-symmetric structure are shown to have comparable efficiencies in DSCs, but with undoubtedly advantages in the low cost and casiness of synthesis for the symmetrical structure. ...

2012

Polar Coding Theorems for Discrete Systems

Eren Sasoglu

Polar coding is a recently invented technique for communication over binary-input memoryless channels. This technique allows one to transmit data at rates close to the symmetric-capacity of such channels with arbitrarily high reliability, using low-complex ...

EPFL2011

Clebsch Optimal Control Formulation In Mechanics

Tudor Ratiu, François Gay-Balmaz

This paper introduces and studies a class of optimal control problems based on the Clebsch approach to Euler-Poincare dynamics. This approach unifies and generalizes a wide range of examples appearing in the literature: the symmetric formulation of N-dimen ...

2011

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