Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes

DOI10.1109/18.490540zbMath0861.94030OpenAlexW2155020285MaRDI QIDQ4887053

R. Kötter

Publication date: 19 May 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.490540

zbMATH Keywords

Reed-Solomon codesgeneralized minimum distance decodingerror erasure-correcting pairsone-point algebraic-geometric codes

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Related Items (5)

Computing minimal interpolation bases ⋮ A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes ⋮ Multitrial decoding of concatenated codes using fixed thresholds ⋮ On multi-trial Forney-Kovalev decoding of concatenated codes ⋮ Polynomial root finding over local rings and application to error correcting codes

This page was built for publication: Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes