Algorithmic polarization for hidden Markov models

DOI10.4230/LIPICS.ITCS.2019.39MaRDI QIDQ5090416zbMATH OpenFDO

Authors Preetum Nakkiran, Venkatesan Guruswami, Madhu Sudan

Publication date 18 July 2022

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

zbMATH Keywords

compressionerror-correcting codeshidden Markov modelpolar codes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
• Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
• A spectral algorithm for learning hidden Markov models
• An entropy sumset inequality and polynomially fast convergence to Shannon capacity over all alphabets

Cites work

• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Fast Polarization for Processes With Memory
• Finite-Length Scaling for Polar Codes
• How to Construct Polar Codes
• Polar codes with exponentially small error at finite block length
• Polar Codes: Characterization of Exponent, Bounds, and Constructions
• Polar Codes: Speed of Polarization and Polynomial Gap to Capacity
• Polar Coding for Processes With Memory
• Polarization and polar codes

Cited in

(3)

• scientific article; zbMATH DE number 7626737 (Why is no real title available?)
• High dimensional binary classification under label shift: phase transition and regularization
• Algorithmic Polarization for Hidden Markov Models

This page was built for publication: Algorithmic polarization for hidden Markov models

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