- Fred Holroyd, Claire Spencer, John Talbot, “Compression and Erdős–Ko–Rado graphs”, Discrete Mathematics, 293, no. 1-3, 2005, 155
- David Ellis, “Setwise intersecting families of permutations”, Journal of Combinatorial Theory, Series A, 119, no. 4, 2012, 825
- Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck, “Generalized Gray Codes for Local Rank Modulation”, IEEE Trans. Inform. Theory, 59, no. 10, 2013, 6664
- B. M. Zlotnik, “Sharply triply transitive projective permutation groups and nonbinary codes generated by them”, Cybern Syst Anal, 18, no. 1, 1982, 19
- Tadashi Wadayama, Manabu Hagiwara, “LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices”, IEEE Trans. Inform. Theory, 58, no. 8, 2012, 5454
- János Barta, Roberto Montemanni, 574, Applied Physics, System Science and Computers III, 2019, 111
- Jörn Quistorff, “Combinatorial problems in the Enomoto-Katona space”, Studia Scientiarum Mathematicarum Hungarica, 46, no. 1, 2009, 121
- Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, I. H. Sudborough, “New lower bounds for permutation arrays using contraction”, Des. Codes Cryptogr., 87, no. 9, 2019, 2105
- Gustav Burosch, Jean-Marie Laborde, “Some Intersection Theorems for Structures”, European Journal of Combinatorics, 9, no. 3, 1988, 207
- Peter J. Dukes, “Coding with injections”, Des. Codes Cryptogr., 65, no. 3, 2012, 213