论文信息 - Bounds for permutation arrays

Bounds for permutation arrays

Abstract A permutation array (P.A.) defined on an r-set of symbols V is a v×r array of rows each of which is a permutation of the symbols of V and such that any two distinct rows have at most (at least) λ common column entries. We list all known bounds for such arrays and make improvements in certain cases. We consider, at length, the case when every pair of distinct rows of the P.A. have precisely λ common column entries.

Michel Deza | Scott A. Vanstone | S. Vanstone | M. Deza

[1] Scott A. Vanstone,et al. Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays , 1978, J. Comb. Theory, Ser. A.

[2] Scott A. Vanstone,et al. Recursive constructions for equidistant permutation arrays , 1977, Journal of the Australian Mathematical Society.

[3] W. D. Wallis,et al. The existence of Room squares , 1975 .

[4] S. A. Vanstone,et al. The Asymptotic Behaviour of Equidistant Permutation Arrays , 1979, Canadian Journal of Mathematics.

[5] Michel Deza. Matrices Dont Deux Lignes Quelconque Coïncident dans un Nombre Donne de Positions Communes , 1976, J. Comb. Theory, Ser. A.

[6] Peter Frankl,et al. On the Maximum Number of Permutations with Given Maximal or Minimal Distance , 1977, J. Comb. Theory, Ser. A.

[7] Jacobus H. van Lint,et al. Equidistant codes with distance 12 , 1977, Discret. Math..

[8] Gérard D. Cohen,et al. Coding with Permutations , 1979, Inf. Control..

[9] Nagayoshi Iwahori. On a property of a finite group , 1964 .