A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence | [Discrete Mathematics Letters • 2022]

Author(s):

1. Simeon Ball: Departament de Matem a`tiques, Universitat Polite`cnica de Catalunya,Carrer Jordi Girona 1-3, 08034 Barcelona,Spain

2. James Dixon: Facultat de Matem a`tiques, Universitat Polite`cnica de Catalunya,Carrer Pau Gargallo, 14, 08028 Barcelona,Spain

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 the field with two elements.

Page(s): 66-68

DOI: 10.47443/dml.2021.0097

Published: Journal: Discrete Mathematics Letters, Volume: 8, Issue: 0, Year: 2022

Keywords:

multigraph isomorphism problem , additive codes , code equivalence

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views