2000 character limit reached
The Exponent of a Polarizing Matrix Constructed from the Kronecker Product
Published 17 Aug 2011 in cs.IT and math.IT | (1108.3417v1)
Abstract: The asymptotic performance of a polar code under successive cancellation decoding is determined by the exponent of its polarizing matrix. We first prove that the partial distances of a polarizing matrix constructed from the Kronecker product are simply expressed as a product of those of its component matrices. We then show that the exponent of the polarizing matrix is shown to be a weighted sum of the exponents of its component matrices. These results may be employed in the design of a large polarizing matrix with high exponent.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.