After the pursuit of seventy years, the invention of polar codes indicates that we have found
the first capacity-achieving coding with low complexity construction and decoding, which is …

Polar codes encounter challenges in decoder complexity while preserving good error-
correction properties. Instead of conventional decoders, a quantum annealer (QA) decoder …

In this letter, we explore the performance limits of short polar codes and find that the
maximum likelihood (ML) performance of a simple CRC-polar concatenated scheme can …

In this paper, we apply polar codes to a modified version of OFDM systems with index
modulation which is called OFDM with in-phase/quadrature index modulation (OFDM-I/Q …

Convolutional precoding in polarization-adjusted convolutional (PAC) codes, a recently
introduced variant of polar codes, has demonstrated an effective reduction in the number of …

Compared to the successive cancellation (SC)-based decoding algorithms, the sphere
decoding (SD) algorithm can achieve better performance with reduced computational …

Polar codes have recently been adopted as a coding scheme for fifth-generation wireless
systems, owing to their excellent performance at short code lengths. In this letter, we …

Sphere decoding (SD) has been proposed as an efficient way to perform maximum-
likelihood (ML) decoding of Polar codes. Its latency requirements, however, are determined …

A reduced complexity sequential decoding algorithm for polar (sub) codes is described. The
proposed approach relies on a decomposition of the polar (sub) code being decoded into a …

Convolutional precoding in polarization-adjusted convolutional (PAC) codes can reduce the
number of minimum weight codewords (aka error coefficient) of polar codes. This can result …