Asymptotically optimal erasure-resilient codes for large disk arrays
Discrete Applied Mathematics - Coding, cryptography and computer security
The Existence of Kirkman Squares—Doubly Resolvable (v,3,1)-BIBDs
Designs, Codes and Cryptography
Solving the Kirkman's Schoolgirl Problem in a Few Seconds
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
There are 50,024 Kirkman triple systems of order 21 admitting an automorphism of order 2. There are 13,280 Kirkman triple systems of order 21 admitting an automorphism of order 3. Together with the 192 known systems and some simple exchange operations, this leads to a collection of 63,745 nonisomorphic Kirkman triple systems of order 21. This includes all KTS(21)s having a nontrivial automorphism group. None of these is doubly resolvable. Four are quadrilateral-free, providing the first examples of such a KTS(21).