paper

A Fast Generalized Minimum Distance Decoder for Reed-Solomon Codes Based on the Extended Euclidean Algorithm

arXiv:1006.0170 · doi:10.1109/ISIT.2010.5513705

Abstract

This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).

ISIT Austin 2010

Cited by in corpus (1)

A Fast Generalized Minimum Distance Decoder for Reed-Solomon Codes Based on the Extended Euclidean Algorithm · wovepaper