学术文献库

Polarization is an unprecedented coding technique in that it not only achieves channel capacity, but also does so at a faster speed of convergence than any other coding technique. This speed is measured by the ``scaling exponent'' and its importance is three-fold. Firstly, estimating the scaling exponent is challenging and demands a deeper understanding of the dynamics of communication channels. Secondly, scaling exponents serve as a benchmark for different variants of polar codes that helps us select the proper variant for real-life applications. Thirdly, the need to optimize for the scaling exponent sheds light on how to reinforce the design of polar codes. In this paper, we generalize the binary erasure channel (BEC), the simplest communication channel and the protagonist of many coding theory studies, to the ``tetrahedral erasure channel'' (TEC). We then invoke Mori--Tanaka's $2 \times 2$ matrix over GF$(4)$ to construct polar codes over TEC. Our main contribution is showing that the dynamic of TECs converges to an almost--one-parameter family of channels, which then leads to an upper bound of $3.328$ on the scaling exponent. This is the first non-binary matrix whose scaling exponent is upper-bounded. It also polarizes BEC faster than all known binary matrices up to $23 \times 23$ in size. Our result indicates that expanding the alphabet is a more effective and practical alternative to enlarging the matrix in order to achieve faster polarization.