dc.contributor.author | Ball, Simeon Michael |
dc.contributor.author | Dixon, James |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2022-03-23T10:10:50Z |
dc.date.available | 2022-03-23T10:10:50Z |
dc.date.issued | 2021-12-02 |
dc.identifier.citation | Ball, S.; Dixon, J. A polynomial-time reduction from the multi-graph isomorphism problem to additive codeequivalence. "Discrete mathematics letters", 2 Desembre 2021, vol. 8, p. 66-68. |
dc.identifier.issn | 2664-2557 |
dc.identifier.uri | http://hdl.handle.net/2117/364757 |
dc.description.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. |
dc.format.extent | 3 p. |
dc.language.iso | eng |
dc.rights | Attribution 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Graph theory |
dc.subject.other | Additive codes |
dc.subject.other | Multi-graph isomorphism problem |
dc.subject.other | Code equivalence |
dc.title | A polynomial-time reduction from the multi-graph isomorphism problem to additive codeequivalence |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics |
dc.identifier.doi | 10.47443/dml.2021.0097 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.relation.publisherversion | https://www.dmlett.com/archive/v8/DML22_v8_pp66-68.pdf |
dc.rights.access | Open Access |
local.identifier.drac | 32539196 |
dc.description.version | Postprint (published version) |
local.citation.author | Ball, S.; Dixon, J. |
local.citation.publicationName | Discrete mathematics letters |
local.citation.volume | 8 |
local.citation.startingPage | 66 |
local.citation.endingPage | 68 |