Publication

Fountain Codes for the Slepian-Wolf Problem

Mohammad Amin Shokrollahi
2006
Conference Papers

Abstract

In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The compression is done by two separate compressors without any exchange of information between them. The decompressor uses a Belief propagation algorithm in conjunction with the Blind Iterative Doping strategy. Simulation results indicate performance close to the Slepian-Wolf limit.

Official source

https://infoscience.epfl.ch/entities/publication/4e24155c-8276-4014-ba38-619564cd5cf5

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Fountain Codes for the Slepian-Wolf Problem

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Spectral Estimators for High-Dimensional Matrix Inference

Teacher-Mediated and Student-Led Interaction with a Physics Simulation: Effects on the Learning Experience