  The polarization process of polar codes over a ternary alphabet is studied.
Recently it has been shown that the scaling of the blocklength of polar codes
with prime alphabet size scales polynomially with respect to the inverse of the
gap between code rate and channel capacity. However, except for the binary
case, the degree of the polynomial in the bound is extremely large. In this
work, it is shown that a much lower degree polynomial can be computed
numerically for the ternary case. Similar results are conjectured for the
general case of prime alphabet size.
