Title
Linear and Nonlinear Binary Kernels of Polar Codes of Small Dimensions With Maximum Exponents
Abstract
Polar codes are constructed based on kernels with polarizing properties. The performance of a polar code is characterized asymptotically in terms of the exponent of its kernel. The pioneering work of Arıkan on polar codes is based on a linear kernel of dimension two and exponent 0.5. In this paper, constructions of linear and nonlinear binary kernels of dimensions up to 16 are presented. The kerne...
Year
DOI
Venue
2015
10.1109/TIT.2015.2469298
IEEE Transactions on Information Theory
Keywords
Field
DocType
Kernel,Hamming distance,Matrix decomposition,Linear codes,Computers,Upper bound,Standards
Kernel (linear algebra),Discrete mathematics,Combinatorics,Nonlinear system,Exponent,Upper and lower bounds,Mathematical analysis,Hamming distance,Polar code,Linear code,Variable kernel density estimation,Mathematics
Journal
Volume
Issue
ISSN
61
10
0018-9448
Citations 
PageRank 
References 
7
0.61
18
Authors
3
Name
Order
Citations
PageRank
hsienping lin1152.50
S. Lin21280124.59
Khaled A. S. Abdel-Ghaffar3616122.03