Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Codes and algebraic curves
On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On Koetter’s Algorithm and the Computation of Error Values
Designs, Codes and Cryptography
A displacement approach to decoding algebraic codes
Contemporary mathematics
List decoding of Reed-Solomon codes from a Gröbner basis perspective
Journal of Symbolic Computation
Algebraic Function Fields and Codes
Algebraic Function Fields and Codes
A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
IEEE Transactions on Information Theory
List decoding of algebraic-geometric codes
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Hermitian codes
IEEE Transactions on Information Theory
Minimum distance decoding of general algebraic geometry codes via lists
IEEE Transactions on Information Theory
| Hi-index | 0.12 |
List decoding of Hermitian codes is reformulated to yield an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Grobner bases of modules. The computational complexity of the algorithm seems comparable to previously known algorithms achieving the same task, and the algorithm is better suited for hardware implementation.