Is code equivalence easy to decide? (Q4371902)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Is code equivalence easy to decide? |
scientific article; zbMATH DE number 1106495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Is code equivalence easy to decide? |
scientific article; zbMATH DE number 1106495 |
Statements
Is code equivalence easy to decide? (English)
0 references
13 April 1998
0 references
equivalent linear codes
0 references
code equivalence
0 references
interactive proofs
0 references
NP-complete
0 references
graph isomorphism problem
0 references
0.8369925618171692
0 references
0.8187065124511719
0 references
0.8137189149856567
0 references
0.8132616877555847
0 references
0.8050298094749451
0 references
