Code equivalence, point set equivalence, and polynomial isomorphism
Designs, Codes and Cryptography · 2026-12 · 94 (12)
DOI: 10.1007/s10623-026-01952-5 ↗Kurz gefasst
Fachartikel in der Zeitschrift Designs, Codes and Cryptography, online erschienen am 20.11.2026. Verfasst von Martin Kreuzer. Die Arbeit nennt 56 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Universität Passau.
Abstract (Originalsprache)
The linear code equivalence (LCE) problem is known to be equivalent to the point set equivalence (PSE) problem, i.e., the problem to check whether two sets of points in a projective space over a finite field differ by a linear change of coordinates. For such a point set $${{\mathbb {X}}}$$ X , let R be its homogeneous coordinate ring and $${{\mathfrak {J}}}_{{\mathbb {X}}}$$ J X its canonical ideal. Then the LCE problem is shown to be equivalent to an algebra isomorphism problem for the doubling $$R/{{\mathfrak {J}}}_{{\mathbb {X}}}$$ R / J X . As this doubling is an Artinian Gorenstein algebra, we can use its Macaulay inverse system to reduce the LCE problem to a Polynomial Isomorphism (PI) problem for homogeneous polynomials. The last step is polynomial time under some mild assumptions about the codes. Moreover, for indecomposable iso-dual codes we can reduce the LCE search problem to the PI search problem of degree 3 by noting that the corresponding point sets are self-associated and arithmetically Gorenstein, so that we can use the isomorphism problem for the Artinian reductions of the coordinate rings and form their Macaulay inverse systems.
Förderung
- Universität Passau
Zitieren
APA
Kreuzer, M. (2026). Code equivalence, point set equivalence, and polynomial isomorphism. Designs, Codes and Cryptography, 94(12). https://doi.org/10.1007/s10623-026-01952-5
Vancouver
Kreuzer M. Code equivalence, point set equivalence, and polynomial isomorphism. Designs, Codes and Cryptography. 2026;94(12). doi:10.1007/s10623-026-01952-5
BibTeX
@article{Kreuzer2026,
author = {Kreuzer, Martin},
title = {Code equivalence, point set equivalence, and polynomial isomorphism},
journal = {Designs, Codes and Cryptography},
year = {2026},
volume = {94},
number = {12},
doi = {10.1007/s10623-026-01952-5}
}
EUVIMED