2 papers
math.CO2021
A polynomial time reduction from the multi-graph isomorphism problem to additive code equivalence
Simeon Ball, James Dixon
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 .
cs.IT2021
The equivalence of linear codes implies semi-linear equivalence
Simeon Ball, James Dixon
We prove that if two linear codes are equivalent then they are semi-linearly equivalent. We also prove that if two additive MDS codes over a field are equivalent then they are addi…