Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels
Information Theory
2010-07-22 v3 math.IT
Abstract
A method of channel polarization, proposed by Arikan, allows us to construct efficient capacity-achieving channel codes. In the original work, binary input discrete memoryless channels are considered. A special case of -ary channel polarization is considered by Sasoglu, Telatar, and Arikan. In this paper, we consider more general channel polarization on -ary channels. We further show explicit constructions using Reed-Solomon codes, on which asymptotically fast channel polarization is induced.
Cite
@article{arxiv.1001.2662,
title = {Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels},
author = {Ryuhei Mori and Toshiyuki Tanaka},
journal= {arXiv preprint arXiv:1001.2662},
year = {2010}
}
Comments
5 pages, a final version of a manuscript for ISIT2010