Faster solution of the key equation for decoding BCH error-correcting codes

Authors:
Victor Y. Pan
Affiliations:
Department of Mathematics and Computer Science, Lehman College, City University of New York, Bronx, NY
Venue:
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Year:
1997

Citing 9
Cited 4

Polynomial division and its computational complexity

Journal of Complexity
Representations and parallel computations for rational functions

SIAM Journal on Computing
Parallel least-squares solution of general and Toeplitz systems

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Parallel computation of polynomial GCD and some related parallel computations over abstract fields

Theoretical Computer Science
Introduction to Coding Theory

Introduction to Coding Theory
Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Fast computation of GCDs

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing

An Efficient Public Key Traitor Tracing Scheme

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Improving the Boneh-Franklin Traitor Tracing Scheme

Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Fast computation of special resultants

Journal of Symbolic Computation
New Techniques for the Computation of Linear Recurrence Coefficients

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract