Corpus ID: 26737627

Modern Error Control Codes and Applications to Distributed Source Coding

@inproceedings{Sartipi2006ModernEC,
  title={Modern Error Control Codes and Applications to Distributed Source Coding},
  author={Mina Sartipi},
  year={2006}
}
  • Mina Sartipi
  • Published 15 August 2006
  • Computer Science, Mathematics
COMPRESSIVE SENSING BASED IMAGING VIA BELIEF PROPAGATION By Preethi
iii ABSTRACT Multiple description coding (MDC) using Compressive Sensing (CS) mainly aims at restoring an image from a small subset of samples with reasonable accuracy using an iterative message

References

SHOWING 1-10 OF 76 REFERENCES
Capacity of wireless erasure networks
TLDR
The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained and it turns out that the capacity region has a nice max-flow min-cut interpretation.
Approaching the slepian-wolf boundary using practical channel codes
We propose a method that allows the use of practical error correcting codes of fixed length to achieve performance close to the Slepian-Wolf boundary without the use of explicit time-sharing arguments
Raptor codes on symmetric channels
TLDR
The asymptotic fraction of output nodes of degree one and two for capacity-achieving Raptor codes is calculated, and techniques to optimize the output degree distribution are discussed.
Slepian-Wolf Coding of Three Binary Sources Using LDPC Codes
TLDR
It is shown how low-density parity-check (LDPC) codes can be used in SlepianWolf coding of three equiprobable, memoryless and correlated binary sources with rates close to the theoretical limit.
LDPC codes can approach the Slepian-Wolf bound for general binary sources,
  • Proc. Allerton Conference on Communication, Control and Computing,
  • 2002
Systematic Lossy Source/Channel Coding
TLDR
The fundamental limits of "systematic" communication are analyzed and it is shown that if nonnegligible bit-error rate is tolerated, systematic encoding is strictly suboptimal.
Good error-correcting codes based on very sparse matrices
  • D. Mackay
  • Computer Science
    Proceedings of IEEE International Symposium on Information Theory
  • 1997
TLDR
It can be proved that, given an optimal decoder, Gallager's low density parity check codes asymptotically approach the Shannon limit.
Design of Slepian-Wolf codes by channel code partitioning
TLDR
This work starts with a detailed solution for general Slepian-Wolf coding based on partitioning a single systematic channel code, and continues with practical code designs using advanced channel codes.
Distributed code constructions for the entire Slepian-Wolf rate region for arbitrarily correlated sources
TLDR
This work proposes a distributed linear block code construction for attaining any point on the Slepian-Wolf achievable rate region for arbitrarily correlated sources using only a single code and describes how to use low density parity check (LDPC) codes in the proposed framework to solve the general Slepia-Wolf problem constructively.
Raptor codes
  • A. Shokrollahi
  • Computer Science
    International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
  • 2004
TLDR
For a given integer k, and any real /spl epsiv/>0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + /spl Epsiv/) is sufficient to recover the original k symbols, with high probability.
...
1
2
3
4
5
...