On PGZ decoding of alternant codes
From MaRDI portal
Publication:2322339
Abstract: In this note 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), then we present an improvement of the method to find the number of errors and the errorlocator polynomial, and finally we illustrate the procedure with several examples. In two appendices we sketch the main features of the system we have used for the computations.
Recommendations
Cites work
Cited in
(5)- Comparison of two algorithms for decoding alternant codes
- scientific article; zbMATH DE number 6691894 (Why is no real title available?)
- Malfunction in the Peterson-Gorenstein-Zierler decoder
- Peterson-Gorenstein-Zierler algorithm for skew RS codes
- Computer algebra tales on Goppa codes and McEliece cryptography
This page was built for publication: On PGZ decoding of alternant codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322339)