مرکز منطقه ای اطلاع رساني علوم و فناوري - A method for computing addition tables in <img src="/images/tex/67.gif" alt="GF(p^n)"> (Corresp.)

DocumentCode :

931509

Title :

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

Author :

Imamura, Kyoki

Volume :

Issue :

fYear :

1980

fDate :

5/1/1980 12:00:00 AM

Firstpage :

367

Lastpage :

369

Abstract :

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 logarithm $Z(x)$ of $x$ is defined by the equation $\\alpha ^{z(x)}=\\alpha ^{x} + 1$ , where $\\alpha$ is a primitive element, zero is written as $\\alpha ^{\\ast }$ , and $x=\\ast ,O,1, \\cdots ,p^{n}-2$ . A simple algorithm for making a table of Zech\´s logarithms is presented.