Extracting randomness and dependencies via a matrix polarization

Details Extracting randomness and dependencies via a matrix polarization Extracting randomness and dependencies via a matrix polarization

2011-02-07

arxiv.org/abs/1102.1247v1

Computer Science

Information Theory

Scientific paper

The basic polarization phenomenon for i.i.d. sources is extended to a framework allowing dependencies within and between multiple sources. In particular, it is shown that taking the polar transform of a random matrix with i.i.d. columns of arbitrary (correlated) distribution allows to extract the randomness and dependencies. This result is the used to develop polar coding schemes (having low complexity) for: (1) distributed data compression, i.e., Slepian-Wolf coding (without decomposing the problem into single-user problems), (2) compression of sources with memory, (3) compression of sources on finite fields, extending the polarization phenomenon for alphabets of prime cardinality to powers of primes.

Affiliated with

Also associated with

No associations

Rating

Extracting randomness and dependencies via a matrix polarization 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 Extracting randomness and dependencies via a matrix polarization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extracting randomness and dependencies via a matrix polarization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680922