In this paper, 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.

翻译：本文提出了一种基于缩短极化码自同构群的低延迟译码方案。针对两种现有缩短模式设计的缩短极化码，其自同构群被证明虽然有限但非空，这使得缩短极化码的自同构集（AE）译码成为可能。本文提供了缩短极化码在AE算法下的广泛仿真结果，并与SC-List（SCL）算法进行了对比。结果表明，缩短极化码在AE译码下的误块率与SCL相当或更优，同时降低了译码延迟。