.png){kind=icon}
.png){kind=icon}
Return
Randomized Polar Subcodes With Optimized Error Coefficient
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2020.3018781.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A method for construction of polar subcodes with reduced error coefficient is presented. The proposed approach relies on explicit enumeration of low-weight non-zero codewords in a polar code, and construction of dynamic freezing constraints which define a subcode not containing most of these codewords. The obtained codes provide a large performance gain in the high-SNR region compared to non-optimized polar subcodes and polar codes with CRC.
Keywords:
Kernel
Error probability
Maximum likelihood decoding
Signal to noise ratio
Encoding
Parity check codes
Polar codes
polar subcodes
weight distribution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W