Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
From MaRDI portal
Publication:4887053
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
Cited in
(17)- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Generalized minimum distance decoding in Euclidean space: performance analysis
- 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
- Algebraic soft- and hard-decision decoding of generalized Reed-Solomon and cyclic codes
- scientific article; zbMATH DE number 2077100 (Why is no real title available?)
- scientific article; zbMATH DE number 2081134 (Why is no real title available?)
- Computing minimal interpolation bases
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- On multi-trial Forney-Kovalev decoding of concatenated codes
- Two classes of minimum generalized distance decoding algorithms
- Polynomial root finding over local rings and application to error correcting codes
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
- scientific article; zbMATH DE number 1047549 (Why is no real title available?)
- Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)
- A subclass of \(q^m\)-ary Reed-Solomon codes and decoding of some rational GAG-codes
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)