Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964)

From MaRDI portal
Revision as of 16:28, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
scientific article

    Statements

    title
    Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (English)
    0 references
    author
    Alexander Vardy
    0 references
    Venkatesan Guruswami
    0 references
    publication date
    21 December 2008
    0 references

    Identifiers

    Mathematics Subject Classification ID
    94B35
    0 references
    94B27
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5454434
    0 references
    arXiv ID
    cs/0405005
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3546964&oldid=33632932"
    Powered by MediaWiki