A polynomial time reduction from the multi-graph isomorphism problem to additive code equivalence
Simeon Ball, James Dixon·2021-08-31·via math.CO updates on arXiv.org
We present a polynomial time reduction from the multi-graph isomorphism problem to the problem of code equivalence of additive codes over finite extensions of ${\mathbb F}_2$.