Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
DOI10.1109/18.490540zbMATH Open0861.94030OpenAlexW2155020285MaRDI QIDQ4887053FDOQ4887053
Authors: 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
Recommendations
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
- Simplified understanding and efficient decoding of a class of algebraic-geometric codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
Reed-Solomon codesgeneralized minimum distance decodingerror erasure-correcting pairsone-point algebraic-geometric codes
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cited In (17)
- Minimum Distance Decoding of General Algebraic Geometry Codes via Lists
- Multitrial decoding of concatenated codes using fixed thresholds
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- Title not available (Why is that?)
- Algebraic soft- and hard-decision decoding of generalized Reed-Solomon and cyclic codes
- Title not available (Why is that?)
- Computing minimal interpolation bases
- Polynomial root finding over local rings and application to error correcting codes
- A subclass of \(q^m\)-ary Reed-Solomon codes and decoding of some rational GAG-codes
- Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)
- On multi-trial Forney-Kovalev decoding of concatenated codes
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- Two classes of minimum generalized distance decoding algorithms
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Title not available (Why is that?)
- Generalized minimum distance decoding in Euclidean space: performance analysis
This page was built for publication: Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887053)
