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

From MaRDI portal
Revision as of 02:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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. I
scientific article

    Statements

    A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I (English)
    0 references
    0 references
    0 references
    0 references
    26 November 2000
    0 references
    decoding
    0 references
    algebraic-geometric codes
    0 references
    recurring relation
    0 references
    minimal polynomial set
    0 references
    algorithm
    0 references
    Berlekamp-Massey algorithm
    0 references
    complexity
    0 references

    Identifiers