Convolutional Polar Kernels
Information Theory
2020-08-27 v1 math.IT
Abstract
A family of polarizing kernels is presented together with polynomial-complexity algorithm for computing scaling exponent. The proposed convolutional polar kernels are based on convolutional polar codes, also known as b-MERA codes. For these kernels, a polynomial-complexity algorithm is proposed to find weight spectrum of unrecoverable erasure patterns, needed for computing scaling exponent. As a result, we obtain scaling exponent and polarization rate for convolutional polar kernels of size up to 1024.
Cite
@article{arxiv.2008.11611,
title = {Convolutional Polar Kernels},
author = {Ruslan Morozov},
journal= {arXiv preprint arXiv:2008.11611},
year = {2020}
}
Comments
10 pages, 3 figures. Submitted to IEEE TCOM