A formula for reg(δ_X) of the minimum distance function in projective nested Cartesian codes is obtained via least-degree indicator functions and the v-number of I_X, together with an arithmetical criterion for the Cayley-Bacharach property.
Carvalho, On the second Hamming weight of some Reed-Muller type codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the regularity index of the minimum distance function in projective nested Cartesian codes
A formula for reg(δ_X) of the minimum distance function in projective nested Cartesian codes is obtained via least-degree indicator functions and the v-number of I_X, together with an arithmetical criterion for the Cayley-Bacharach property.