Cartesian square-free codes
By: Cícero Carvalho, Hiram H. López, Rodrigo San-José
Potential Business Impact:
Makes secret codes stronger and easier to break.
The generalized Hamming weights (GHWs) of a linear code C extend the concept of minimum distance, which is the minimum cardinality of the support of all one-dimensional subspaces of C, to the minimum cardinality of the support of all r-dimensional subspaces of the code. In this work, we introduce Cartesian square-free codes, which are linear codes generated by evaluating square-free monomials over a Cartesian set. We use commutative algebraic tools, specifically the footprint bound, to provide explicit formulas for some of the GHWs of this family of codes, and we show how we can translate these results to evaluation codes over the projective space.
Similar Papers
Gröbner bases and the second generalized Hamming weight of a linear code
Commutative Algebra
Finds hidden patterns in secret codes.
On the Hamming Weight Functions of Linear Codes
Information Theory
Creates new codes from existing ones.
Linear codes over $\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}$ with mixed-alphabet defining sets and their Gray images: Constructions of projective few-weight, distance-optimal and minimal codes
Information Theory
Creates better codes for secret messages and sharing.