On decoding algorithms for polar codes
Ilya Dumer
TL;DR
This paper reviews various list decoding algorithms for polar codes, comparing their complexities to enhance understanding of decoding strategies for these codes.
Contribution
It provides a comprehensive survey and comparison of existing list decoding algorithms for polar codes, highlighting their complexity differences.
Findings
List decoding algorithms vary significantly in complexity
Successive cancellation decoding is a key method discussed
Comparison aids in selecting appropriate algorithms for applications
Abstract
We survey the known list decoding algorithms for polar codes and compare their complexity. Index terms: Polar codes; Reed-Muller codes; successive cancellation decoding.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · DNA and Biological Computing · Coding theory and cryptography