ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES. II

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 algorit...

Full description

Saved in:
Bibliographic Details
Published inVestnik of Samara University Natural Science Series Vol. 27; no. 2; pp. 7 - 15
Main Authors Ratseev, S. M., Cherevatenko, O. I.
Format Journal Article
LanguageEnglish
Published 30.03.2022
Online AccessGet full text
ISSN2541-7525
2712-8954
2712-8954
DOI10.18287/2541-7525-2021-27-2-7-15

Cover

More Information
Summary: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.
ISSN:2541-7525
2712-8954
2712-8954
DOI:10.18287/2541-7525-2021-27-2-7-15