Abstract: Recent developments in formal verification of arithmetic datapaths make efficient use of symbolic computer algebra algorithms. The circuit is modeled as an ideal in polynomial rings, and ...
Several classes of permutation trinomials from Niho exponents over finite fields of characteristic 3
State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, P. R. China State Key Laboratory of Cryptology, P. O. Box 5159, Beijing 100878, P. R. China State Key Laboratory ...
remove-circle Internet Archive's in-browser bookreader "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see ...
For n = 2,3 and finite field 𝔼 of characteristic greater than n, we provide a complete and irredundant list of soluble irreducible subgroups of GL (n,𝔼). The insoluble irreducible subgroups of GL (2 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback