By Topic

A method for computing addition tables in GF(p^n) (Corresp.)

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)

Conway showed that a table of Zech's logarithms is useful to perform addition in GF(p^{n})when the elements are represented as powers of a primitive element. The Zech's logarithmZ(x)ofxis defined by the equationalpha^{z(x)}=alpha^{x} + 1, wherealphais a primitive element, zero is written asalpha^{ast}, andx=ast,O,1, cdots ,p^{n}-2. A simple algorithm for making a table of Zech's logarithms is presented.

Published in:

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