Name
Abstract | ||
|---|---|---|
Perpendicular Arrays are orderedcombinatorial structures, which recently have found applicationsin cryptography. A fundamental construction uses as ingredientscombinatorial designs and uniformly t-homogeneoussets of permutations. We study the latter type of objects. Thesemay also be viewed as generalizations of t-homogeneousgroups of permutations. Several construction techniques are given.Here we concentrate on the optimal case, where the number ofpermutations attains the lower bound. We obtain several new optimalsuch sets of permutations. Each example allows the constructionof infinite families of perpendicular arrays. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1023/A:1027333822360 | Des. Codes Cryptography |
Keywords | Field | DocType |
permutation group,combinatorial design,lower bound | Discrete mathematics,Combinatorics,Claw-free permutation,Golomb–Dickman constant,Upper and lower bounds,Permutation,Permutation group,Derangement,Parity of a permutation,Combinatorial design,Mathematics | Journal |
Volume | Issue | ISSN |
9 | 1 | 1573-7586 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Bierbrauer | 1 | 332 | 45.54 |
| Stephen Black | 2 | 0 | 0.34 |
| Yves Edel | 3 | 141 | 17.61 |