We prove that, for the binary erasure channel (BEC), the polar-coding paradigm gives rise to
codes that not only approach the Shannon limit but do so under the best possible scaling of …

Visible light communication (VLC) offers wireless communication within short-range based
on wavelength converters and light-emitting diode (LED). In the VLC system, conventional …

A decoding algorithm for polar (sub) codes with binary 2 t× 2 t polarization kernels is
presented. It is based on the window processing (WP) method, which exploits the linear …

Polar coding gives rise to the first explicit family of codes that provably achieve capacity for a
wide range of channels with efficient encoding and decoding. But how fast can polar coding …

We study partial orders (POs) for the synthesized bit-channels of polar codes. First, we give
an alternative proof of an existing PO for bit-channels with the same Hamming weight and …

We prove 1-\left(1-x^M\right)^2^M>\left(1-(1-x)^M\right)^2^M for all x∈ 0, 1 and all M> 1. This
confirms a conjecture about polar code, made by Wu and Siegel in 2019, that W^0^m1^M is …

The construction of polar codes with code length involves layers of polar transforms. In this
paper, we observe that after each layer of polar transforms, one can swap certain pairs of …

Polar codes approach channel capacity provably and empirically and are thereby a
constituent code of the 5G standard. Compared to low-density parity-check codes, however …

Polar codes constructed with large polarization kernels were recently proven to be able to
achieve optimal finite-length scaling properties. However, straightforward decoding for large …

This letter proposes a reinterpretation of the classical binary Golay codes as Polar codes
with additional inner permutations and puncturing. This establishes a novel relationship …