Is code equivalence easy to decide? (Q4371902)

From MaRDI portal
Revision as of 01:02, 7 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 1106495
Language Label Description Also known as
English
Is code equivalence easy to decide?
scientific article; zbMATH DE number 1106495

    Statements

    title
    Is code equivalence easy to decide? (English)
    0 references
    DOI
    10.1109/18.623157
    0 references
    author
    Erez Petrank
    0 references
    Ron M. Roth
    0 references
    publication date
    13 April 1998
    0 references
    Mathematics Subject Classification ID
    94B05
    0 references
    68Q25
    0 references
    05C60
    0 references
    zbMATH DE Number
    1106495
    0 references
    zbMATH Keywords
    equivalent linear codes
    0 references
    code equivalence
    0 references
    interactive proofs
    0 references
    NP-complete
    0 references
    graph isomorphism problem
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4371902&oldid=18370425"
    Powered by MediaWiki