|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematics
On decoding algorithms for generalized Reed — Solomon codes with errors and erasures. II
S. M. Ratseeva, O. I. Cherevatenkob a Ulyanovsk State University, Ulyanovsk, Russian Federation
b Ulyanovsk State University of Education, Ulyanovsk, Russian Federation
(published under the terms of the Creative Commons Attribution 4.0 International License)
Abstract:
The article is a continuation of the authors' work «On decoding algorithms for generalized Reed —Solomon codes with errors and erasures». In this work, another modification of the Gao algorithm and the Berlekamp — Massey algorithm is given. The first of these algorithms is a syndrome-free decoding algorithm, the second is a syndrome decoding algorithm. The relevance of these algorithms is that they are applicable for decoding Goppa codes, which are the basis of some promising post-quantum cryptosystems.
Keywords:
error-correcting codes, Reed — Solomon codes, Goppa codes, code decoding.
Received: 05.02.2021 Revised: 10.03.2021 Accepted: 28.05.2021
Citation:
S. M. Ratseev, O. I. Cherevatenko, “On decoding algorithms for generalized Reed — Solomon codes with errors and erasures. II”, Vestnik SamU. Estestvenno-Nauchnaya Ser., 27:2 (2021), 7–15
Linking options:
https://www.mathnet.ru/eng/vsgu651 https://www.mathnet.ru/eng/vsgu/v27/i2/p7
|
Statistics & downloads: |
Abstract page: | 113 | Full-text PDF : | 21 | References: | 21 |
|