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.
No takes yet. Share an insight, caveat, or question.
Camps-Moreno et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: