Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions
Abstract
Polar transforms are central operations in the study of polar codes. This paper examines polar transforms for non-stationary memoryless sources on possibly infinite source alphabets. This is the first attempt of source polarization analysis over infinite alphabets. The source alphabet is defined to be a Polish group, and we handle the Ar{\i}kan-style two-by-two polar transform based on the group. Defining erasure distributions based on the normal subgroup structure, we give recursive formulas of the polar transform for our proposed erasure distributions. As a result, the recursive formulas lead to concrete examples of multilevel source polarization with countably infinite levels when the group is locally cyclic. We derive this result via elementary techniques in lattice theory.
Keywords
Cite
@article{arxiv.1904.11721,
title = {Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions},
author = {Yuta Sakai and Ken-ichi Iwata and Hiroshi Fujisaki},
journal= {arXiv preprint arXiv:1904.11721},
year = {2020}
}
Comments
12 pages, 1 figure, a short version has been accepted by the 2019 IEEE International Symposium on Information Theory (ISIT2019)