## Abstract

The lattice structure of conventional linear congruential random number generators (LCGs), over integers, is well known. In this paper, we study LCGs in the field of formal Laurent series, with coefficients in the Galois field F^{2} The state of the generator (a Laurent series) evolves according to a linear recursion and can be mapped to a number between 0 and 1, producing what we call a LS2 sequence. In particular, the sequences produced by simple or combined Tausworthe generators are special cases of LS2 sequences. By analyzing the lattice structure of the LCG, we obtain a precise description of how all the k-dimensional vectors formed by successive values in the LS2 sequence are distributed in the unit hypercube. More specifically, for any partition of the fc-dimensional hypercube into 2^{kl}identical subcubes, we can quickly compute a table giving the exact number of subcubes that contain exactly n points, for each integer n . We give numerical examples and discuss the practical implications of our results.

Original language | English |
---|---|

Pages (from-to) | 749-761 |

Number of pages | 13 |

Journal | Mathematics of Computation |

Volume | 60 |

Issue number | 202 |

DOIs | |

Publication status | Published - Apr 1993 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics