Well equidistributed long-period linear
The Well Equidistributed Long-period Linear (WELL) is a pseudorandom number generator developed in 2006 by F. Panneton, P. L'Ecuyer, and M. Matsumoto  that is based on linear recurrences modulo 2 over a finite binary field .
There are a number of versions of the WELL generator proposed: WELL512a, WELL521a, WELL521b, WELL607a, WELL607b, WELL800a, WELL800b, WELL1024a, WELL1024b, WELL19937a, WELL19937b, WELL19937c, WELL21701a, WELL23209a, WELL23209b, WELL44497a, WELL44497b.
- Implementations of WELL512a, WELL1024a, WELL19937a, WELL19937c, WELL44497a, WELL44497b in C (Free for non-commercial use)
- Implementation of WELL512a in Scala
- Implementation of WELL1024a in Scala
- Implementation of WELL19937a in Scala
- Implementation of WELL19937c in Scala
- Implementation of WELL44497a in Scala
- Implementation of WELL44497b in Scala
- Implementations of WELL512, WELL607, WELL800, WELL1024, WELL19937, WELL21701, WELL23209 and WELL44497 in C++
- Implementations of WELL512, WELL1024, WELL607 in Java
- Implementations of WELL512, WELL1024 in BBC BASIC
- A modified "maximally equidistributed" implementations of WELL19937, WELL44497 in C (Free for non-commercial use)
- Implementation of WELL512 in C (Public Domain)
- Panneton, F. O.; l'Ecuyer, P.; Matsumoto, M. (2006). "Improved long-period generators based on linear recurrences modulo 2". ACM Transactions on Mathematical Software 32 (1): 1–16. doi:10.1145/1132973.1132974.
|P ≟ NP||This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.|