In recent years, polar codes have been considered for communication systems that require high re-liability and ultra-low latency, such as sixth generation (6G) wireless communications. This paper presents simulation results showing that short binary extended BCH (eBCH) codes with low-complexity decoding outperform polar codes for lengths 64 and 128. In the simulations, polar mapping under additive white Gaussian noise (AWGN) is assumed and ordered-statistics decoding (OSD) of eBCH codes is compared with CRC-aided successive-cancellation list decoding (SCLD-CRC) of polar codes of the same lengths and rates. The results indicate that short-length binary eBCH codes achieve lower average bit error rate values (higher reliability) and thus should be considered as strong candidates in communication systems requiring extremely low latency, i.e., short code lengths of up to 128 bits. The eBCH simulation results are obtained with OSD and re-processing order equal to one so that complexity is comparable to SCLD-CRC. Specifically, error performances are quantified of length-64 and selected length-128 eBCH codes with order-1 OSD and polar codes with SCLD-CRC for the same rates and lengths. These results serve to verify that short binary eBCH codes do indeed outperform short polar codes with comparable decoding complexity.

翻译：近年来，极化码已被考虑应用于需要高可靠性和超低延迟的通信系统，例如第六代（6G）无线通信。本文提出的仿真结果表明，采用低复杂度译码的短二进制扩展BCH（eBCH）码在长度为64和128时性能优于极化码。仿真中假设加性高斯白噪声（AWGN）信道下的极化映射，并将eBCH码的有序统计译码（OSD）与相同长度和码率的极化码的CRC辅助连续消除列表译码（SCLD-CRC）进行比较。结果表明，短长度二进制eBCH码实现了更低的平均误比特率（更高的可靠性），因此应被视为要求极低延迟（即码长不超过128比特的短码）通信系统的有力候选方案。eBCH码的仿真结果通过采用重处理阶数为1的OSD获得，以使其复杂度与SCLD-CRC相当。具体而言，本文量化了采用一阶OSD的长度为64及选定长度为128的eBCH码，与采用SCLD-CRC的相同码率和长度的极化码的误码性能。这些结果证实了在可比译码复杂度下，短二进制eBCH码确实优于短极化码。