LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Publisher: Mathematical and Software Engineering
Journal: Mathematical and Software Engineering
Languages: English
Types: Article
Subjects: Extended Galois Field; GF(p); GF(p^m); Primitive Polynomials

Classified by OpenAIRE into

ACM Ref: ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
The paper aims to suggest algorithms for Extended Galois Field generation and calculation. The algorithm analysis shows that the proposed algorithm for finding primitive polynomial is faster than traditional polynomial search and when table operations in GF(pm) are used the algorithms are faster than traditional polynomial addition and subtraction.
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article