.png){kind=icon}
.png){kind=icon}
Return
Polar Subcodes
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2015.2504269.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Polar codes
generalized concatenated codes
BCH codes
Reed-Solomon codes.
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W