Polar coding for the Slepian-Wolf problem based on monotone chain rules
dc.citation.epage | 570 | en_US |
dc.citation.spage | 566 | en_US |
dc.contributor.author | Arıkan, Erdal | en_US |
dc.coverage.spatial | Cambridge, MA, USA | en_US |
dc.date.accessioned | 2016-02-08T12:12:41Z | |
dc.date.available | 2016-02-08T12:12:41Z | |
dc.date.issued | 2012 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 1-6 July 2012 | en_US |
dc.description.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. | en_US |
dc.identifier.doi | 10.1109/ISIT.2012.6284254 | en_US |
dc.identifier.isbn | 978-1-4673-2580-6 | en_US |
dc.identifier.issn | 2157-8117 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/28157 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | https://doi.org/10.1109/ISIT.2012.6284254 | en_US |
dc.source.title | 2012 IEEE International Symposium on Information Theory Proceedings | en_US |
dc.subject | Monotone chain rules | en_US |
dc.subject | Polar codes | en_US |
dc.subject | Slepian-Wolf problem | en_US |
dc.subject | Source polarization | en_US |
dc.subject | Coding scheme | en_US |
dc.subject | Monotone chain | en_US |
dc.subject | Problem-based | en_US |
dc.subject | Slepian-wolf | en_US |
dc.subject | Time-sharing | en_US |
dc.subject | Information theory | en_US |
dc.subject | Polarization | en_US |
dc.title | Polar coding for the Slepian-Wolf problem based on monotone chain rules | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Polar coding for the Slepian-Wolf problem based on monotone chain rules.pdf
- Size:
- 137.97 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version