Polar decreasing monomial-Cartesian codes

In this article, we introduce a new family of polar codes from evaluation codes, called polar decreasing monomial-Cartesian codes, and prove that families of polar codes with multiple kernels over certain symmetric channels can be viewed as polar decreasing monomial-Cartesian codes. This offers a unified treatment for such codes over any finite field. We define decreasing monomial-Cartesian codes ...