By Topic

Self-reciprocal polynomials and generalized Fermat numbers

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)
Gulliver, T.A. ; Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada

Self-reciprocal polynomials (SRPs) over GF(q), where q is a prime power, q=pk, are investigated. The maximum possible component for these polynomials is found for q odd. The construction of Fermat maximum exponent self-reciprocal polynomials (MRPs) over GF(2) is extended to GF(2k ) with the aid of generalized Fermat numbers. These polynomials leads to a bound on the maximum possible exponent of SRPs over GF(2k), and a simplified algorithm for finding these MRPs. Self-reciprocal polynomials have applications in cryptography, error-correction coding, and the synthesis of linear feedback shift registers. They are advantageous when available memory or hardware is restricted or when data can be read in either direction. Some results on quasi-self-reciprocal polynomials are also presented

Published in:

Information Theory, IEEE Transactions on  (Volume:38 ,  Issue: 3 )