Polar codes with exponentially small error at finite block length

DOI10.4230/LIPICS.APPROX-RANDOM.2018.34MaRDI QIDQ5009529FDOQ5009529

Authors: Jarosław Błasiok, Venkatesan Guruswami, Madhu Sudan 

Publication date: 4 August 2021

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

Recommendations

• Item:QQ5066948
• Item:QQ5066948
• Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity
• Polar codes
• Polar codes with higher-order memory

zbMATH Keywords

polar codeserror exponentrate of polarization

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (4)

• Polar Codes with exponentially small error at finite block length
• Algorithmic polarization for hidden Markov models
• Finite-Length Scaling for Polar Codes
• On the Finite Length Scaling of <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Polar Codes

This page was built for publication: Polar codes with exponentially small error at finite block length

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