A polynomial time reduction from the multi-graph isomorphism problem to additive code equivalence

Abstract

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$.