"Real" Slepian-Wolf Codes

Details "Real" Slepian-Wolf Codes "Real" Slepian-Wolf Codes

2008-10-08

arxiv.org/abs/0810.1424v1

Computer Science

Information Theory

20 pages. Preliminary version presented at ISIT 2008, Toronto, Canada

Scientific paper

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 linear over the real field achieve the classical Slepian-Wolf rate-region. For finite alphabets we show that typicality decoding is equivalent to solving an integer program. Minimum entropy decoding is also shown to achieve exponentially small probability of error. The techniques used may be of independent interest for code design for a wide class of information theory problems, and for the field of compressed sensing.

Affiliated with

Also associated with

No associations

Rating

"Real" Slepian-Wolf Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with "Real" Slepian-Wolf Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and "Real" Slepian-Wolf Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30095