No Detail Found!

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

Author(s)
Simeon Ball Departament de Matem a`tiques, Universitat Polite`cnica de Catalunya,Carrer Jordi Girona 1-3, 08034 Barcelona,Spain
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.
Publication Details
Page(s) 66-68
DOI 10.47443/dml.2021.0097
Published Journal: Discrete Mathematics Letters, Volume: 8, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
multi-graph isomorphism problem, additive codes, code equivalence
More from Discrete Mathematics Letters
0

Citations

0

Downloads

120

Views

Copyright ©  PASTIC National Center, Islamabad www.pastic.gov.pk