Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Niederreiter, Harald
1995.
Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing.
Vol. 106,
Issue. ,
p.
87.
Meyn, Helmut
1995.
ExplicitN-polynomials of 2-power degree over finite fields, I.
Designs, Codes and Cryptography,
Vol. 6,
Issue. 2,
p.
107.
Blackburn, S. R.
1996.
A note on sequences with the shift and add property.
Designs, Codes and Cryptography,
Vol. 9,
Issue. 3,
p.
251.
Blackburn, S. R.
1996.
A Note on Sequences with the Shift and Add Property.
Designs, Codes and Cryptography,
Vol. 9,
Issue. 3,
p.
251.
Roth, R.M.
1997.
Probabilistic crisscross error correction.
IEEE Transactions on Information Theory,
Vol. 43,
Issue. 5,
p.
1425.
Koc, C.K.
and
Acar, T.
1997.
Fast software exponentiation in GF(2/sup k/).
p.
225.
Hofmeister, Thomas
Krause, Matthias
and
Simon, Hans U.
1997.
Computing and Combinatorics.
Vol. 1276,
Issue. ,
p.
176.
Muzhong Wang
and
Blake, I.F.
1997.
Normal basis of the finite field F/sub 2/(p-1)p/sup m/ over F/sub 2/.
IEEE Transactions on Information Theory,
Vol. 43,
Issue. 2,
p.
737.
Rieke, A.
Sadeghi, A.-R.
and
Poguntke, W.
1998.
On primitivity tests for polynomials.
p.
53.
Safavi-Naini, Rei
Bakhtiari, Shahram
and
Charnes, Chris
1998.
Fast Software Encryption.
Vol. 1372,
Issue. ,
p.
134.
Ar, Sigal
Lipton, Richard J.
Rubinfeld, Ronitt
and
Sudan, Madhu
1998.
Reconstructing Algebraic Functions from Mixed Data.
SIAM Journal on Computing,
Vol. 28,
Issue. 2,
p.
487.
Koc, Cetin K.
and
Acar, Tolga
1998.
Montgomery Multiplication in GF(2k).
Designs, Codes and Cryptography,
Vol. 14,
Issue. 1,
p.
57.
Koc, C.K.
and
Sunar, B.
1998.
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields.
IEEE Transactions on Computers,
Vol. 47,
Issue. 3,
p.
353.
Murphy, S.
1998.
Bound for linear complexityof BBS sequences.
Electronics Letters,
Vol. 34,
Issue. 11,
p.
1057.
Espona, M.
and
Serra, O.
1998.
Cayley Digraphs Based on the de Bruijn Networks.
SIAM Journal on Discrete Mathematics,
Vol. 11,
Issue. 2,
p.
305.
Mitchell, Chris J.
and
Paterson, Kenneth G.
1998.
Perfect Factors from Cyclic Codes and Interleaving.
SIAM Journal on Discrete Mathematics,
Vol. 11,
Issue. 2,
p.
241.
Niederreiter, Harald
and
Xing, Chaoping
1998.
Towers of Global Function Fields with Asymptotically Many Rational Places and an Improvement on the Gilbert ‐ Varshamov Bound.
Mathematische Nachrichten,
Vol. 195,
Issue. 1,
p.
171.
Bodlaender, Hans L.
and
Hagerup, Torben
1998.
Parallel Algorithms with Optimal Speedup for Bounded Treewidth.
SIAM Journal on Computing,
Vol. 27,
Issue. 6,
p.
1725.
Maurer, Ueli M.
and
Wolf, Stefan
1999.
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms.
SIAM Journal on Computing,
Vol. 28,
Issue. 5,
p.
1689.
Hofmeister, Thomas
1999.
Computational Learning Theory.
Vol. 1572,
Issue. ,
p.
101.