.png){kind=icon}
.png){kind=icon}
Return
Shortened Polar Codes Under Automorphism Ensemble Decoding
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2024.3365091.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we propose a low-latency decoding solution of shortened polar codes based on their automorphism groups. The automorphism group of shortened polar codes, designed according to two existing shortening patterns, are shown to be limited but non-empty, making the Automorphism Ensemble (AE) decoding of shortened polar codes possible. Extensive simulation results for shortened polar codes under AE are provided and are compared to the SC-List (SCL) algorithm. The block-error rate of shortened polar codes under AE matches or beats SCL while lowering the decoding latency.
Keywords:
Codes
Polar codes
Maximum likelihood decoding
Reliability
Reed-Muller codes
Low latency communication
Noise measurement
Encoding
decoding
polar codes