Suitable Permutations, Binary Covering Arrays, and Paley Matrices-Reference-Cited by-同舟云学术

Suitable Permutations, Binary Covering Arrays, and Paley Matrices

Published:2015 Issue: Volume: Page:29-42
ISSN:2194-1009
Container-title:Algebraic Design Theory and Hadamard Matrices
language:
Short-container-title:

Author:

Colbourn Charles J.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-17729-8_3

Reference28 articles.

1. Bennett, F.E., Wei, R., Yin, J., Mahmoodi, A.: Existence of DBIBDs with block size six. Utilitas Math. 43, 205–217 (1993)

2. Colbourn, C.J.: Covering arrays from cyclotomy. Des. Codes Crypt. 55(2–3), 201–219 (2010)

3. Colbourn, C.J.: Covering arrays and hash families. In: Information Security and Related Combinatorics, NATO Peace and Information Security, pp. 99–136. IOS Press, Amsterdam (2011)

4. Colbourn, C.J., Kéri, G.: Binary covering arrays and existentially closed graphs. In: Coding and Cryptology. Lecture Notes in Computer Science, vol. 5557, pp. 22–33. Springer, Berlin (2009)

5. Colbourn, C.J., Kéri, G., Rivas Soriano, P.P., Schlage-Puchta, J.C.: Covering and radius-covering arrays: constructions and classification. Discret. Appl. Math. 158, 1158–1190 (2010)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Suitable sets of permutations, packings of triples, and Ramsey’s theorem;European Journal of Combinatorics;2020-01

2. Better bounds for poset dimension and boxicity;Transactions of the American Mathematical Society;2019-10-18

3. On the structure of small strength‐2 covering arrays;Journal of Combinatorial Designs;2019-09-08

4. Constructions and nonexistence results for suitable sets of permutations;Journal of Combinatorial Theory, Series A;2017-05

5. Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations;Combinatorica;2017-02-21