### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings |

Pages | 8-14 |

Number of pages | 7 |

DOIs | |

State | Published - May 13 2011 |

Externally published | Yes |

Event | 2011 Information Theory and Applications Workshop, ITA 2011 - San Diego, CA, United States Duration: Feb 6 2011 → Feb 11 2011 |

### Publication series

Name | 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings |
---|

### Other

Other | 2011 Information Theory and Applications Workshop, ITA 2011 |
---|---|

Country | United States |

City | San Diego, CA |

Period | 2/6/11 → 2/11/11 |

### All Science Journal Classification (ASJC) codes

- Computational Theory and Mathematics
- Computer Science Applications
- Information Systems

## Fingerprint Dive into the research topics of 'Randomness and dependencies extraction via polarization'. Together they form a unique fingerprint.

## Cite this

*2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings*(pp. 8-14). [5743556] (2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings). https://doi.org/10.1109/ITA.2011.5743556