Cart (Loading....) | Create Account
Close category search window
 

An algorithm for computing bidirectional minimal polynomials for multisequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Li-Ping Wang ; Center for Adv. Study, Tsinghua Univ., Beijing, China

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.

Published in:

Information Theory, 2009. ISIT 2009. IEEE International Symposium on

Date of Conference:

June 28 2009-July 3 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.