Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

MOC
2000

favoriteEmaildiscussreport

132views more MOC 2000»

Lattice computations for random numbers

13 years 4 months ago

Lattice computations for random numbers

Download www.ams.org

We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to the problem of constructing, for such generators, an output mapping yielding optimal k-distribution.

Raymond Couture, Pierre L'Ecuyer

Real-time Traffic

Finite Fields | Lattice Algorithm | MOC 2000 | Random Number Generators |

claim paper

Related Content

» Classification of integral lattices with large class number

» The First Order Theories of the Medvedev and Muchnik Lattices

» The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant

» Polynomial time quantum algorithm for the computation of the unit group of a number field

» Short Bases of Lattices over Number Fields

» Randomized Lattice Decoding

» Consonant Random Sets Structure and Properties

» Lattices on simplicial partitions

» The complexity of choosing an Hcolouring nearly uniformly at random

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	MOC
Authors	Raymond Couture, Pierre L'Ecuyer

Comments (0)