Polar Subcodes
arXiv:1511.01646 · doi:10.1109/JSAC.2015.2504269
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.
Accepted to IEEE JSAC special issue on Recent Advances In Capacity Approaching Codes
References in corpus (2)
Cited by in corpus (11)
- Belief Propagation List Decoding of Polar Codes
- List Decoding of Arikan's PAC Codes
- Polar Codes and Their Quantum-Domain Counterparts
- Practical Product Code Construction of Polar Codes
- Efficient decoding of polar codes with some 1616 kernels
- Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes
- Soft-Output Successive Cancellation List Decoding
- Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection
- Frozen Set Design for Precoded Polar Codes
- Successive Cancellation Decoding with Future Constraints for Polar Codes Over the Binary Erasure Channel
- Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding