A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A generalization of Arıkan's polar code construction using transformations of the form $G^{\otimes n}$ where $G$ is an $\ell \times \ell$ matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is shown that a large class of such transformations polarize symmetric binary-input memoryless channels.
7 pages, 1 figure

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/173881

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0811.1770
 http://arxiv.org/abs/0811.1770

Collections

arXiv