|
This article is cited in 6 scientific papers (total in 6 papers)
Mathematics
On decoding algorithms for Goppa codes
S. M. Ratseev Ulyanovsk State University, Ulyanovsk, Russia
Abstract:
The paper is devoted to the decoding algorithms for Goppa codes. These codes are an important part of some promising post-quantum cryptographic algorithms. The Patterson algorithm is well known for decoding Goppa codes, but it is only applicable for binary codes. Since Goppa codes can be specified using generalized Reed — Solomon codes, any decoding algorithm for such codes is also applicable to Goppa codes. The algorithms for decoding Goppa codes based on the algorithm Sugiyama algorithm, Gao algorithm, Berlekamp — Massey algorithm (Peterson — Gorenstein — Zierler algorithm) are given. The Patterson algorithm is also given.
Keywords:
error-correcting code, Goppa code, Reed — Solomon code, code decoding.
Received: 21.04.2020 Revised: 15.07.2020
Citation:
S. M. Ratseev, “On decoding algorithms for Goppa codes”, Chelyab. Fiz.-Mat. Zh., 5:3 (2020), 327–341
Linking options:
https://www.mathnet.ru/eng/chfmj192 https://www.mathnet.ru/eng/chfmj/v5/i3/p327
|
Statistics & downloads: |
Abstract page: | 457 | Full-text PDF : | 211 | References: | 40 |
|