Article contents
Equidistant permutation arrays: a bound
Published online by Cambridge University Press: 09 April 2009
Abstract
An equidistant permutation array is a ν × r array A(r, λ;ν) defined on a r-set X such that every row of A is a permutation of X and any two distinct rows agree in precisely λ common columns. Define In this paper, we show that where n = r − λ. Certain results pertaining to irreducible equidistant permutation arrays are also established.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1982
References
- 3
- Cited by