Real Slepian-Wolf Codes - Computer Science > Information TheoryReport as inadecuate

Real Slepian-Wolf Codes - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d.sources over finite alphabets.
We demonstrate that random codes that are linearover the real field achieve the classical Slepian-Wolf rate-region.
For finitealphabets we show that typicality decoding is equivalent to solving an integerprogram.
Minimum entropy decoding is also shown to achieve exponentially smallprobability of error.
The techniques used may be of independent interest forcode design for a wide class of information theory problems, and for the fieldof compressed sensing.

Author: Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg



Related documents