Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels
arXiv:1801.04422 · doi:10.1109/ISIT.2018.8437921
Abstract
This study examines multilevel channel polarization for a certain class of erasure channels that the input alphabet size is an arbitrary composite number. We derive limiting proportions of partially noiseless channels for such a class. The results of this study are proved by an argument of convergent sequences, inspired by Alsan and Telatar's simple proof of polarization, and without martingale convergence theorems for polarization process.
31 pages; 1 figure; 1 table; a short version of this paper has been submitted to the 2018 IEEE International Symposium on Information Theory (ISIT2018)
References in corpus (5)
- Polarization for arbitrary discrete memoryless channels
- Ergodic Theory Meets Polarization. I: An Ergodic Theory for Binary Operations
- A Generalized Erasure Channel in the Sense of Polarization for Binary Erasure Channels
- Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels
- Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization