Description Usage Arguments Details Value Author(s) References See Also Examples

The function constructs sets of mutually othogonal latin squares (MOLS) using Galois fields. The construction works for prime powers only.

1 |

`p` |
A prime number less than 100. |

`n` |
A positive integer. |

`primpol` |
A primitive polynomial of the Galois Field GF( |

If *trt = p^n* is a prime power, then *trt*-1 latin squares of order *trt*
are constructed.
The elements of the squares are numbered 1,...,*trt*.
These squares are mutually orthogonal, i.e. if any two of them are superimposed, the resulting
array will contain each ordered pair *(i,j)*, *i*,*j* in {1,...,
*trt*} exactly once.
The squares are in standard order, i.e. the first row is always equal to (1,...,*trt*).
A primitive polynomial may be constructed automatically using the internal function `GF`

.

For *trt = p^n*, an array that contains *trt*-1 latin squares is returned.

Oliver Sailer

Cherowitzo, W.: http://www-math.cudenver.edu/~wcherowi/courses/finflds.html

Street, A.P. and Street, D.J. (1987): Combinatorics of experimental design. Oxford University Press, Oxford.

1 2 |

crossdes documentation built on May 30, 2017, 4:14 a.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.