The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes

Details The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes

2010-06-14

arxiv.org/abs/1006.2860v1

Computer Science

Information Theory

Scientific paper

10.1109/CIG.2010.5592677

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

Affiliated with

Also associated with

No associations

Rating

The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104088