Algebraic Properties of Polar Codes From a New Polynomial Formalism
Magali Bardet, Vlad Dragoi, Ayoub Otmani, Jean-Pierre Tillich

TL;DR
This paper introduces a new polynomial formalism to analyze the algebraic structure of polar codes, revealing universal properties and symmetries that improve understanding of their minimum weight codewords and decoding performance.
Contribution
It establishes a partial order on monomials generating polar codes, uncovering their algebraic and group-theoretic properties, which were previously not well understood.
Findings
Monomials generating polar codes form a decreasing set under a defined partial order.
The permutation group of these codes contains a large lower triangular affine group.
Minimum weight codewords correspond to orbits of monomials in the generating set.
Abstract
Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding. These codes are closely related to Reed-Muller codes because both can be described with the same algebraic formalism, namely they are generated by evaluations of monomials. However, finding the right set of generating monomials for a polar code which optimises the decoding performances is a hard task and channel dependent. The purpose of this paper is to reveal some universal properties of these monomials. We will namely prove that there is a way to define a nontrivial (partial) order on monomials so that the monomials generating a polar code devised fo a binary-input symmetric channel always form a decreasing set. This property turns out to have rather deep consequences on the structure of the polar code.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
