A Fast Generalized Minimum Distance Decoder for Reed-Solomon Codes Based on the Extended Euclidean Algorithm
Information Theory
2010-09-08 v1 math.IT
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).
Cite
@article{arxiv.1006.0170,
title = {A Fast Generalized Minimum Distance Decoder for Reed-Solomon Codes Based on the Extended Euclidean Algorithm},
author = {Sabine Kampf and Martin Bossert},
journal= {arXiv preprint arXiv:1006.0170},
year = {2010}
}
Comments
ISIT Austin 2010