The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes
classification
💻 cs.IT
math.IT
keywords
algorithmdecodingdistanceeuclideangeneralizedminimumcodesextended
read the original abstract
This paper presents a method to merge Generalized Minimum Distance decoding of Reed-Solomon codes with the extended Euclidean algorithm. By merge, we mean that the steps taken to perform the Generalized Minimum Distance decoding are similar to those performed by the extended Euclidean algorithm. The resulting algorithm has a complexity of O(n^2).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.