Back to Search
Start Over
On the Finite Length Scaling of $q$ -Ary Polar Codes.
- Source :
- IEEE Transactions on Information Theory; Nov2018, Vol. 64 Issue 11, p7153-7170, 18p
- Publication Year :
- 2018
-
Abstract
- The polarization process of polar codes over a prime $q$ -ary alphabet is studied. Recently, it has been shown that 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 paper, a different approach to computing the degree of this polynomial for any prime alphabet size is shown. This approach yields a lower degree polynomial for various values of the alphabet size that were examined. It is also shown that even lower degree polynomial can be computed with an additional numerical effort. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 64
- Issue :
- 11
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 132546157
- Full Text :
- https://doi.org/10.1109/TIT.2018.2865742