Patterson Decoding Algorithm

The Patterson Decoding Algorithm is a syndrome-based decoding method for binary Goppa codes that extends the Guruswami-Sudan list decoding framework by incorporating efficient polynomial interpolation and root-finding techniques to correct errors beyond half the minimum distance in the context of code-based cryptography.

2

Publications

28

Citations

5

Authors

2

Institutions

Publications per year

2017–2026

1

Authors

5

  1. SP
    Sven Puchinger

    Universität Ulm, Germany

    1 publications · 14 citations

    1

    h-index

  2. LH
    Lukas Holzbaur

    Technical University of Munich, Germany

    1 publications · 14 citations

    1

    h-index

  3. AW
    Antonia Wachter-Zeh

    Technical University of Munich, Germany

    1 publications · 14 citations

    1

    h-index

  4. KH
    Kurt Huber

    Wilhelminen Hospital, Austria

    1 publications · 14 citations

    1

    h-index

  5. HL
    Hedongliang Liu

    Technical University of Munich, Germany

    1 publications · 14 citations

    1

    h-index

1–5 of 5

Institutions

2

  1. Deutsche Telekom (Germany)

    Bonn, Germany

    1 h-index

    1 publications

    14 citations

  2. Technical University of Munich

    Munich, Germany

    1 h-index

    4 publications

    56 citations

1–2 of 2

Venues

  1. Electronics Letters

    1 publications · 14 citations

    1

    h-index

1–1