2013 IEEE International Symposium on Information Theory 2013
DOI: 10.1109/isit.2013.6620436
|View full text |Cite
|
Sign up to set email alerts
|

Polarization theorems for arbitrary DMCs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
46
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 12 publications
(46 citation statements)
references
References 9 publications
0
46
0
Order By: Relevance
“…Later, it was generalized to prime-input discrete memoryless channels (DMCs) in [9], to prime power-input DMCs in [5], [6] and to arbitrary DMCs in [2]- [4], [7], [8], [10]. The proofs in [5]- [8], [10] all follow Arıkan's proof technique, which is based on the properties of the Battacharyya parameter and mutual information of virtual channels.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…Later, it was generalized to prime-input discrete memoryless channels (DMCs) in [9], to prime power-input DMCs in [5], [6] and to arbitrary DMCs in [2]- [4], [7], [8], [10]. The proofs in [5]- [8], [10] all follow Arıkan's proof technique, which is based on the properties of the Battacharyya parameter and mutual information of virtual channels.…”
Section: Introductionmentioning
confidence: 99%
“…Instead, the proof is based on the entropy inequality of virtual channels, i.e., the mutual information of the virtual channels is strictly different from that of the original channel. As an extension of [9], the This work has been funded in part by the European Research Council under ERC grant agreement 259663, the Spanish Ministry of Economy and Competitiveness under grant TEC2012-38800-C03-03, and the FP7 Network of Excellence NEWCOM# under grant agreement 318306. channel polarization theorem is proved in [4] for arbitrary DMCs with input alphabet set forming a quasigroup.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations