Fast Polarization for Processes With Memory

DOI10.1109/TIT.2018.2878575MaRDI QIDQ5223910zbMATH OpenOpenAlexWikidataFDO

Authors Boaz Shuval, Ido Tal

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.02849

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Abstract: Fast polarization is crucial for the performance guarantees of polar codes. In the memoryless setting, the rate of polarization is known to be exponential in the square root of the block length. A complete characterization of the rate of polarization for models with memory has been missing. Namely, previous works have not addressed fast polarization of the high entropy set under memory. We consider polar codes for processes with memory that are characterized by an underlying ergodic finite-state Markov chain. We show that the rate of polarization for these processes is the same as in the memoryless setting, both for the high and for the low entropy sets.

Cited in

(1)

• Algorithmic polarization for hidden Markov models

This page was built for publication: Fast Polarization for Processes With Memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223910)