TL;DR
This paper introduces polar subcodes with dynamic frozen symbols that improve minimum distance and decoding efficiency, outperforming traditional LDPC, turbo, and standard polar codes.
Contribution
It proposes a new construction of polar codes with dynamic frozen symbols as subcodes of extended BCH codes, enhancing performance and decoding.
Findings
Higher minimum distance than classical polar codes
Efficient decoding with successive cancellation algorithms
Outperforms LDPC, turbo, and CRC-polar codes
Abstract
An extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbols, to be data-dependent. A construction of polar codes with dynamic frozen symbols, being subcodes of extended BCH codes, is proposed. The proposed codes have higher minimum distance than classical polar codes, but still can be efficiently decoded using the successive cancellation algorithm and its extensions. The codes with Arikan, extended BCH and Reed-Solomon kernel are considered. The proposed codes are shown to outperform LDPC and turbo codes, as well as polar codes with CRC.
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.