Abstract
In this paper we give an algorithm for computing a bidirectional minimal polynomial (a characteristic polynomial with not only minimal degree but also a nonzero constant term) of a given finite-length multisequence by modifying a lattice-based linear feedback shift register synthesis algorithm for multisequences. We also describe the set of all such polynomials for a multisequence.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
