On the decoding of binary cyclic codes with the Newton identities (Q733502)

From MaRDI portal
Revision as of 02:10, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the decoding of binary cyclic codes with the Newton identities
scientific article

    Statements

    On the decoding of binary cyclic codes with the Newton identities (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2009
    0 references
    The authors look at decoding binary cyclic codes with Gröbner bases. They study, in particular, properties defined by Newton identities for decoding binary cyclic codes. In a two-step process involving varieties and Gröbner bases, they provide an efficient practical procedure. They conclude with some computational results for codes of length approximately one hundred.
    0 references
    0 references
    0 references
    0 references
    0 references
    cyclic codes
    0 references
    quadratic residue codes
    0 references
    elimination theory
    0 references
    Gröbner basis
    0 references
    \(F4\) algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references