A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II (Q1283084)

From MaRDI portal
Revision as of 10:17, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II
scientific article

    Statements

    A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II (English)
    0 references
    0 references
    0 references
    0 references
    26 November 2000
    0 references
    algebraic-geometric codes
    0 references
    recurring relation
    0 references
    majority voting scheme
    0 references
    generalized Berlekamp-Massey algorithm
    0 references
    decoding algorithms
    0 references
    Feng-Rao bound
    0 references
    complexity
    0 references

    Identifiers