On the complexity of minimum distance decoding of long linear codes (Q4701401)

From MaRDI portal
Revision as of 02:50, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1365309
Language Label Description Also known as
English
On the complexity of minimum distance decoding of long linear codes
scientific article; zbMATH DE number 1365309

    Statements

    On the complexity of minimum distance decoding of long linear codes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 1999
    0 references
    0 references
    decoding algorithm
    0 references
    \(q\)-ary linear codes
    0 references
    supercode decoding
    0 references
    error probability
    0 references
    minimum-distance decoding
    0 references
    covering-set decoding
    0 references
    split syndrome decoding
    0 references
    0 references