Multisequence Synthesis over an Integral Domain
- 1.2k Downloads
We first give an extension of F[x]-lattice basis reduction algorithm to the polynomial ring R[x] where F is a field and R an arbitrary integral domain. So a new algorithm is presented for synthesizing minimum length linear recurrence (or minimal polynomials) for the given multiple sequences over R. Its computational complexity is O(N 2) multiplications in R where N is the length of each sequence. A necessary and sufficient conditions for the uniqueness of minimal polynomials are given. The set of all minimal polynomials is also described.
Unable to display preview. Download preview PDF.
- 2.Lu, P. Z., Liu, M. L.: Gröbner basis for characteristic ideal of linear recurrence sequence over UFD. Science in China (Series A), vol. 28, No. 6. 508–519 (1998)Google Scholar
- 5.Wang, L. P., Zhu, Y. F.: F[x]-lattice basis reduction algorithm and multisequence synthesis. Science in China, in pressGoogle Scholar
- 7.Lagarias, J. C., Odlyzko, A. M.: Soluting low density subset problems. Pro. 24th Annual IEEE Symp. on Found of Comp. Science (1983) 1–10Google Scholar