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

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding algebraic-geometric codes up to the designed minimum distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority coset decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified understanding and efficient decoding of a class of algebraic-geometric codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decoding of algebraic-geometric codes / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02917055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3112130401 / rank
 
Normal rank

Latest revision as of 10:58, 30 July 2024

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