On the affine permutation group of certain decreasing Cartesian codes
Combinatorics
2024-05-15 v1
Abstract
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.
Cite
@article{arxiv.2405.08112,
title = {On the affine permutation group of certain decreasing Cartesian codes},
author = {Eduardo Camps-Moreno and Hiram H. López and Eliseo Sarmiento and Ivan Soprunov},
journal= {arXiv preprint arXiv:2405.08112},
year = {2024}
}