Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Lattice Computations for Random Numbers

Raymond Couture and Pierre L'Ecuyer
Mathematics of Computation
Vol. 69, No. 230 (Apr., 2000), pp. 757-765
Stable URL: http://www.jstor.org/stable/2584900
Page Count: 9
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Lattice Computations for Random Numbers
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
757
    757
  • Thumbnail: Page 
758
    758
  • Thumbnail: Page 
759
    759
  • Thumbnail: Page 
760
    760
  • Thumbnail: Page 
761
    761
  • Thumbnail: Page 
762
    762
  • Thumbnail: Page 
763
    763
  • Thumbnail: Page 
764
    764
  • Thumbnail: Page 
765
    765