Close category search window
 

Generation of linear recursive sequences from irreducible polynomials over GF(Q)

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)
Lam, M.S. ; Dept. of Eng., Purdue Univ., Fort Wayne, IN, USA

Linear recursive sequences generated from irreducible polynomials over GF(q), q=Pm, a prime power, are investigated. These sequences are expressed as vector linear recursive sequences whose component sequences may be obtained directly from an irreducible polynomial over GF(p). The relationship between these components is investigated. A method of generating the primitive and nonprimitive irreducible polynomials is also discussed

Published in:
Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on

Date of Conference: 14-17 May 1991

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.