On PGZ decoding of alternant codes
View/Open
Cita com:
hdl:2117/361228
Document typeArticle
Defense date2019-03-01
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 4.0 International
Abstract
In this paper, we first review the classical Petterson–Gorenstein–Zierler decoding algorithm for the class of alternant codes, which includes Reed–Solomon, Bose–Chaudhuri–Hocquenghem and classical Goppa codes. Afterwards, we present an improvement of the method to find the number of errors and the error-locator polynomial. Finally, we illustrate the procedure with several examples. In two appendices, we sketch the main features of the computer algebra system designed and developed to support the computations.
CitationFarre, R.; Sayols, N.; Xambo, S. On PGZ decoding of alternant codes. "COMPUTATIONAL & APPLIED MATHEMATICS", 1 Març 2019, vol. 38, núm. 1, p. 1-13.
ISSN1807-0302
Publisher versionhttps://link.springer.com/article/10.1007/s40314-019-0795-7
Other identifiershttps://arxiv.org/abs/1704.05259
Files | Description | Size | Format | View |
---|---|---|---|---|
1704.05259.pdf | 169,8Kb | View/Open |