Computational method and apparatus for finite field arithmetic
作者： James L. Massey , Jimmy K. Omura
DOI:
关键词:
摘要: Elements of the finite field GF(2 m ) are represented by a vector binary digits in such way that multiplication can be performed using same logic function to compute each component product two elements, squaring circuitry rotates representing element squared, and addition forms modulo-two sum corresponding components vectors elements summed.
lens.org 参考文章(9)
Elwyn R Berlekamp, Galois field computer. ,(1981)
J M Marver, Complexity Reduction in Galois Logic Design. ,(1977)
G Solomon, Error-correcting decoder for group codes ,(1972)
Leonard Rabins, Gordon E. Gregg, Thomas H. Howell, Table lookup direct decoder for double-error correcting (DEC) BCH codes using a pair of syndromes ,(1975)
Leonard Rabins, Gordon E. Gregg, Thomas H. Howell, Matrix multiplier in GF(2m) ,(1975)
Wayne R. Olson, James M. Marver, Sequential Galois multiplication in GF(2n) with GF(2m) Galois multiplication gates ,(1979)
Thomas C. Bartee, David I. Schneider, Computation with finite fields Information & Computation. ,vol. 6, pp. 79- 98 ,(1963) , 10.1016/S0019-9958(63)90129-3
Sou-Hsiung J. Chiu, Finite field multiplier ,(1978)
Rabins Leonard, Gregg Gordon E, Howell Thomas H, Matrix multiplier in GF(2{HU m{b ) ,(1977)