Voir la notice de l'article provenant de la source Cambridge University Press
Vanstone, S. A. The Asymptotic Behaviour of Equidistant Permutation Arrays. Canadian journal of mathematics, Tome 31 (1979) no. 1, pp. 45-48. doi: 10.4153/CJM-1979-005-0
@article{10_4153_CJM_1979_005_0,
author = {Vanstone, S. A.},
title = {The {Asymptotic} {Behaviour} of {Equidistant} {Permutation} {Arrays}},
journal = {Canadian journal of mathematics},
pages = {45--48},
year = {1979},
volume = {31},
number = {1},
doi = {10.4153/CJM-1979-005-0},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1979-005-0/}
}
[1] 1. Bolton, D. W., unpublished manuscript. Google Scholar
[2] 2. Deza, M., Matrices dont deux lignes quelconques coincident dans un nombre donne de positions communes, Journal of Combinatorial Theory, Series A. 20 (1976), 306–318. Google Scholar
[3] 3. Deza, M., Mullin, R. C. and Vanstone, S. A., Room squares and equidistant permutation arrays, Ars Combinatori. 2 (1976), 235–244. Google Scholar
[4] 4. Heinrich, K., van Rees, J., and Wallis, W. D., A general construction jor equidistant permutation arrays, (preprint). Google Scholar
[5] 5. Mullin, R. C., An asymptotic property of (r, λ)-systems, Utilitas Math. 3 (1973), 139–152. Google Scholar
[6] 6. Schellenberg, P. J., and Vanstone, S. A., Some results on equidistant permutation arrays, Proc. 6th Manitoba Conference on Numerical Math (1976), 389–410. Google Scholar
[7] 7. Vanstone, S. A., Pairwise orthogonal generalized Room squares and equidistant permutation arrays, Journal of Combinatorial Theory, Series A. 25 (1978), 84–89. Google Scholar
Cité par Sources :