Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
List decoding of algebraic-geometric codes
IEEE Transactions on Information Theory
Performance analysis of a decoding algorithm for algebraic-geometry codes
IEEE Transactions on Information Theory
Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Efficient Traitor Tracing Algorithms Using List Decoding
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On Representations of Algebraic-Geometric Codes for List Decoding
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Sudan-decoding generalized geometric Goppa codes
Finite Fields and Their Applications
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
Theoretical Computer Science
Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q- polynomial, and a reduction of the problemof factoring the Q-polynomial to the problem of factoring a univariate polynomial over a large finite field.