An algebraic model for linear code equivalence is constructed using invariant rational functions on the Grassmannian under diagonal action, producing high-degree polynomials satisfied by the permutation matrix.
Cryptology ePrint Archive, Report 2025/227 (2025), https://eprint.iacr.org/2025/227
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Linear Code Equivalence via Pl\"ucker Coordinates
An algebraic model for linear code equivalence is constructed using invariant rational functions on the Grassmannian under diagonal action, producing high-degree polynomials satisfied by the permutation matrix.