A polynomial time reduction from the multi-graph isomorphism problem to additive code equivalence
| Autor: | Ball, Simeon, Dixon, James |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | 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 ${\mathbb F}_2$. |
| Databáze: | arXiv |
| Externí odkaz: |
|