
























A decreasing Cartesian code is defined by evaluating a monomial set closed under divisibility on a Cartesian set. Some well-known examples are the Reed-Solomon, Reed-Muller, and (some) toric codes. The affine permutations consist of the permutations of the code that depend on an affine transformation. In this work, we study the affine permutations of some decreasing Cartesian codes, including the case when the Cartesian set has copies of multiplicative or additive subgroups.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。