Browsing by Author "Dixon, James"
Now showing items 1-2 of 2
-
A polynomial-time reduction from the multi-graph isomorphism problem to additive codeequivalence
(2021-12-02)
Article
Open AccessWe present a polynomial-time reduction from the multi-graph isomorphism problem to the problem of code equivalence of additive codes over finite extensions of the field with two elements. -
The equivalence of linear codes implies semi-linear equivalence
(2022-07-01)
Article
Open AccessWe 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 additively equivalent.
