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
Abstract—A method to construct nonasymmetric distributed source coding (DSC) scheme using polar code...
Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary dis...
Cataloged from PDF version of article.Polar coding is a code construction method that can be used t...
A polar coding method to construct a distributed source coding scheme which can achieve any point on...
This paper describes a successive cancellation decoder of polar codes for the two-user binary-input ...
The notion of source polarization is introduced and investigated. This complements the earlier work ...
We consider a nonasymmetric distributed source coding (DSC) scheme invented by Gehrig which can achi...
Polar coding is a recently invented technique for communication over binary-input memoryless channel...
We introduce a property that we call Successive Description property for Slepian Wolf coding. We sho...
Abstract—We construct a channel coding scheme to achieve the capacity of any discrete memoryless cha...
The two central topics of information theory are the compression and the transmission of data. Shann...
Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger p...
Arikan's 'polar coding' is a technique to achieve the symmetric capacity of binary input memoryless ...
Abstract—This paper investigates universal polar coding schemes. In particular, a notion of ordering...
Polar codes, introduced recently by Arikan, are the first family of codes known to achieve capacity ...
Abstract—A method to construct nonasymmetric distributed source coding (DSC) scheme using polar code...
Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary dis...
Cataloged from PDF version of article.Polar coding is a code construction method that can be used t...
A polar coding method to construct a distributed source coding scheme which can achieve any point on...
This paper describes a successive cancellation decoder of polar codes for the two-user binary-input ...
The notion of source polarization is introduced and investigated. This complements the earlier work ...
We consider a nonasymmetric distributed source coding (DSC) scheme invented by Gehrig which can achi...
Polar coding is a recently invented technique for communication over binary-input memoryless channel...
We introduce a property that we call Successive Description property for Slepian Wolf coding. We sho...
Abstract—We construct a channel coding scheme to achieve the capacity of any discrete memoryless cha...
The two central topics of information theory are the compression and the transmission of data. Shann...
Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger p...
Arikan's 'polar coding' is a technique to achieve the symmetric capacity of binary input memoryless ...
Abstract—This paper investigates universal polar coding schemes. In particular, a notion of ordering...
Polar codes, introduced recently by Arikan, are the first family of codes known to achieve capacity ...
Abstract—A method to construct nonasymmetric distributed source coding (DSC) scheme using polar code...
Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary dis...
Cataloged from PDF version of article.Polar coding is a code construction method that can be used t...
DOI
Add to ORKG