Show simple item record

dc.contributor.authorArıkan, Erdalen_US
dc.coverage.spatialCambridge, MA, USAen_US
dc.date.accessioned2016-02-08T12:12:41Z
dc.date.available2016-02-08T12:12:41Z
dc.date.issued2012en_US
dc.identifier.isbn978-1-4673-2580-6en_US
dc.identifier.issn2157-8117en_US
dc.identifier.urihttp://hdl.handle.net/11693/28157
dc.descriptionDate of Conference: 1-6 July 2012en_US
dc.description.abstractWe 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.language.isoEnglishen_US
dc.source.title2012 IEEE International Symposium on Information Theory Proceedingsen_US
dc.relation.isversionofhttps://doi.org/10.1109/ISIT.2012.6284254en_US
dc.subjectMonotone chain rulesen_US
dc.subjectPolar codesen_US
dc.subjectSlepian-Wolf problemen_US
dc.subjectSource polarizationen_US
dc.subjectCoding schemeen_US
dc.subjectMonotone chainen_US
dc.subjectProblem-baseden_US
dc.subjectSlepian-wolfen_US
dc.subjectTime-sharingen_US
dc.subjectInformation theoryen_US
dc.subjectPolarizationen_US
dc.titlePolar coding for the Slepian-Wolf problem based on monotone chain rulesen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage566en_US
dc.citation.epage570en_US
dc.identifier.doi10.1109/ISIT.2012.6284254en_US
dc.publisherIEEEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record