Polar coding for the Slepian-Wolf problem based on monotone chain rules

Date

2012

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
0
views
77
downloads

Citation Stats

Series

Abstract

We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions. © 2012 IEEE.

Source Title

2012 IEEE International Symposium on Information Theory Proceedings

Publisher

IEEE

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English