Nothing
PGM2: Recursive Construction of Nested Resolvable Designs and Associated Uniform Designs over GF(p)
Recursive construction of balanced incomplete block designs (BIBDs), their successive generations, resolvable BIBDs (RBIBDs) and associated uniform designs (UDs), derived from finite projective geometries PG(m, p) over a Galois field GF(p) of any prime order p. Implements and generalises the method of Boudraa, Gheribi-Aoulmi and Laib (2013, International Journal of Research and Reviews in Applied Sciences, 17(2), 167-176), which was previously available only for p = 2, and the uniform design constructions of Fang et al. (2004) <doi:10.1016/S0012-365X(03)00100-6>. Designs of every recursion stage can be extracted, and all constructions are validated against the parameters published in the original paper.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Mohamed Laib [aut, cre], Abla Boudraa [aut], Zebida Gheribi-Aoulmi [aut] |
| Maintainer | Mohamed Laib <laib.med@gmail.com> |
| License | GPL-3 |
| Version | 2.0.1 |
| URL | https://mlaib.net https://github.com/mlaib/PGM2 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the PGM2 package in your browser
Any scripts or data that you put into this service are public.
