Extension of the Berlekamp-Massey algorithm to N dimensions
Information and Computation
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
A displacement approach to efficient decoding of algebraic-geometric codes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
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
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
List decoding of Hermitian codes using Gröbner bases
Journal of Symbolic Computation
Minimum distance decoding of general algebraic geometry codes via lists
IEEE Transactions on Information Theory
| Hi-index | 0.06 |
Fast interpolation methods for the original and improved versions of list decoding of one-point algebraic-geometry codes are presented. The methods are based on the Gr枚bner basis theory and the BMS algorithm for multiple arrays, although their forms are different in the original list decoding algorithm (Sudan algorithm) and the improved list decoding algorithm (Guruswami-Sudan algorithm). The computational complexity is less than that of the conventional Gaussian elimination method.