A polynomial time reduction from the multi-graph isomorphism problem to additive code equivalence
Combinatorics
2021-09-01 v1
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 .
Keywords
Cite
@article{arxiv.2108.13683,
title = {A polynomial time reduction from the multi-graph isomorphism problem to additive code equivalence},
author = {Simeon Ball and James Dixon},
journal= {arXiv preprint arXiv:2108.13683},
year = {2021}
}