paper

Polar Coding for Processes with Memory

arXiv:1602.01870

Abstract

We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a channel. The memory may be present in the channel, the input, or both. We show that -mixing processes polarize under the standard Arıkan transform, under a mild condition. We further show that the rate of polarization of the \emph{low-entropy} synthetic channels is roughly , where is the blocklength. That is, essentially the same rate as in the memoryless case.

arXiv commentSubmitted to IEEE Transactions on Information Theory

References in corpus (2)

Cited by in corpus (6)