Peter Keevash, Cheng Yeaw Ku, “A random construction for permutation codes and the covering radius”, Des Codes Crypt, 41, № 1, 2006, 79
Cheng Yeaw Ku, Kok Bin Wong, “AN ANALOGUE OF THE HILTON-MILNER THEOREM FOR WEAK COMPOSITIONS”, Bulletin of the Korean Mathematical Society, 52, № 3, 2015, 1007
Giacomo Micheli, Alessandro Neri, “New Lower Bounds for Permutation Codes Using Linear Block Codes”, IEEE Trans. Inform. Theory, 66, № 7, 2020, 4019
Peter Borg, “Cross-intersecting families of permutations”, Journal of Combinatorial Theory, Series A, 117, № 4, 2010, 483
Peter Frankl, “An exact result for $(0, \pm \, 1)$ ( 0 , ± 1 ) -vectors”, Optim Lett, 12, № 5, 2018, 1011
Steve Fisk, Daniel Abbw-Jackson, Dan Kleitman, “Helly-type theorems about sets”, Discrete Mathematics, 32, № 1, 1980, 19
Cunsheng Ding, “Optimal Constant Composition Codes From Zero-Difference Balanced Functions”, IEEE Trans. Inform. Theory, 54, № 12, 2008, 5766
Peter Frankl, Andreas Holmsen, Andrey Kupavskii, “Intersection Theorems for Triangles”, Discrete Comput Geom, 68, № 3, 2022, 728
Y. M. Chee, H. M. Kiah, A. C. H. Ling, C. Wang, “Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications”, J of Combinatorial Designs, 23, № 4, 2015, 151
Nathan Lindzey, “Erdős–Ko–Rado for perfect matchings”, European Journal of Combinatorics, 65, 2017, 130