New Techniques for the Computation of Linear Recurrence Coefficients

Finite Fields and their Applications

Volumn 6, Issue 1, 2000, Pages 93-118

  Pan, Victor Y ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Berlekamp Massey linear recurrence problem; Decoding BCH error correcting codes; Pad approximation; Power sums; Sparse matrices in finite fields; Sparse multivariate polynomial interpolation

Indexed keywords

EID: 0008860249     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1006/ffta.1999.0267     Document Type: Article

References (35)

1. Berlekamp E. R. Algebraic Coding Theory. 1968;McGraw-Hill, New York.
2. Brent R. P., Gustavson F. G., Yun D. Y. Y. Fast solution of Toeplitz systems of equations and computation of Padé approximations. J. Algorithms. 1:1980;259-295.
3. Ben-Or M., Tiwari P. A deterministic algorithm for sparse multivariate polynomial interpolation. Proceedings 20th Annual ACM Symposium on Theory of Computing. 1988;Assoc. Comput. Mach. New York. p. 301-309.
4. D. Bini, and, V. Y. Pan, Polynomial and Matrix Computations. Volume, 1, Fundamental Algorithms, Birkhäuser, Boston, Cambridge, MA, 1994.
5. Brent R. P. Multiple-precision zero-finding methods and the complexity of elementary function evaluation. Traub J. F., Analytical Computational Complexity. 1975;151-176 Academic Press, New York.
6. Cantor D. G., Kaltofen E. On fast multiplication of polynomials over arbitrary rings. Acta Inform. 28:1991;697-701.
7. Demillo R. A., Lipton R. J. A probabilistic remark on algebraic program testing. Inform. Process. Lett. 7:1978;193-195.
8. von zur Gathen J. Representation and parallel computations for rational functions. SIAM J. Comput. 15:1986;432-452.
9. Gragg W. B. The Padé table and its relation to certain algorithms of numerical analysis. SIAM Rev. 14:1972;1-62.
10. Kakeya S. On fundamental systems of symmetric functions. Japan. J. Math. 2:1925;69-80.
11. Kakeya S. On fundamental systems of symmetric functions. Japan. J. Math. 4:1927;77-85.
12. Kaltofen E. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. Math. Comp. 64:1995;777-806.
13. Kaltofen E., Lakshman Y. N., Wiley J. M. Modular rational sparse multivariate polynomial interpolation. Proceedings ACM-SIGSAM Inter-national Symposium on Symbolic and Algebraic Computation (ISSAC '90). 1990;Assoc. Comput. Mach. New York. p. 135-139.
14. Kaltofen E., Pan V. Y. Processor efficient parallel solution of linear systems over an abstract field. Proceedings 3rd Annual ACM Symposium on Parallel Algorithms and Architectures. 1991;Assoc. Comput. Mach. New York. p. 180-191.
15. Mandelbaum D. M. A method for decoding of generalized Goppa codes. IEEE Trans. Inform. Theory. 23:1977;137-140.
16. Massey J. L. Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory. 15:1969;122-127.
17. Mills W. H. Continued fractions and linear recurrences. Math. Comp. 29:1975;173-180.
18. Moenck R. Fast computation of GCDs. Proceedings 5th Annual ACM Symposium on Theory of Computing. 1973;Assoc. Comput. Mach. New York. p. 142-151.
19. Nakamura K. On the representation of symmetric functions by power-sums which form the fundamental system. Japan J. Math. 4:1927;87-92.
20. Pan V. Y. Parallel least-squares solution of general and Toeplitz-like linear systems. Proceedings 2nd Annual ACM Symposium on Parallel Algorithms and Architectures. 1990;Assoc. Comput. Mach. New York. p. 244-253.
21. Pan V. Y. Parallel computation of polynomial GCD and some related parallel computations over abstract fields. Theoret. Comput. Sci. 162:1996;173-223.
22. Pan V. Y. Fast solution of the key equation for decoding the BCH error-correcting codes. Proceedings 27th Annual ACM Symposium on Theory of Computing. 1997;Assoc. Comput. Mach. New York. p. 168-175.
23. V. Y. Pan, New deterministic parallel algorithms for the characteristic polynomial of a matrix over abstract fields, preprint, 1999.
24. Patterson N. J. The algebraic decoding of Goppa codes. IEEE Trans. Inform. Theory. 21:1975;203-207.
25. Sain M. K. Minimum torsion spaces and the practical input/output problem. Inform. Control. 29:1975;103-124.
26. Schwartz J. T. Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27:1980;701-717.
27. Sarwate D. V. On the complexity of decoding Goppa codes. IEEE Trans. Inform. Theory. 23:1977;515-516.
28. Schönhage A. The fundamental theorem of algebra in terms of computational complexity. 1982;University of TübingenDepartment of Math. Tübingen.
29. Schönhage A. Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristics. Proceedings 20th ICALP Lecture Notes in Computer Science. 700:1993;Springer-Verlag, Berlin. p. 410-417.
30. Sugiyama Y., Kasahara M., Hirawawa S., Namekawa T. A method for solving key equation for decoding Goppa codes. Inform. Control. 27:1975;87-99.
31. Vahlen K. T. Über Fundamentalsysteme für symmetrisch Functionen. Acta Math. 23:1900;91-120.
32. van der Waerden B. L. Modern Algebra. 1953;Ungar, New York.
33. Wiedemann D. H. Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory. 32:1986;54-62.
34. Yun D. Y. Y. On square-free decomposition algorithms. Proceedings ACM Symposium on Symbolic and Algebraic Computation. 1976;Assoc. Comput. Mach. New York. p. 26-35.
35. Zippel R. E. Probabilistic algorithms for sparse polynomials. Proceedings EUROSAM 79 Lecture Notes in Computer Science. 72:1979;Springer-Verlag, Berlin. p. 216-226.