- Peter Borg, “On t-intersecting families of signed sets and permutations”, Discrete Mathematics, 309, no. 10, 2009, 3310
- Fei Gao, Yiting Yang, Gennian Ge, “An Improvement on the Gilbert–Varshamov Bound for Permutation Codes”, IEEE Trans. Inform. Theory, 59, no. 5, 2013, 3059
- Peter J. Cameron, Ian M. Wanless, “Covering radius for sets of permutations”, Discrete Mathematics, 293, no. 1-3, 2005, 91
- Li Wang, “Setwise intersecting families in classical Coxeter groups”, Discrete Mathematics, 342, no. 4, 2019, 1170
- Emil Faure, Anatoly Shcherba, Mykola Makhynko, Bohdan Stupka, Joanna Nikodem, Ruslan Shevchuk, “Permutation-Based Block Code for Short Packet Communication Systems”, Sensors, 22, no. 14, 2022, 5391
- Clara Franchi, “On Permutation Groups of Finite Type”, European Journal of Combinatorics, 22, no. 6, 2001, 821
- Evan DeCorte, David de Laat, Frank Vallentin, “Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs”, Experimental Mathematics, 23, no. 2, 2014, 146
- Jun Wang, Huajun Zhang, “Nontrivial independent sets of bipartite graphs and cross-intersecting families”, Journal of Combinatorial Theory, Series A, 120, no. 1, 2013, 129
- Yonatan Yehezkeally, Moshe Schwartz, “Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation”, IEEE Trans. Inform. Theory, 2017, 1
- Cheng Yeaw Ku, Kok Bin Wong, “A non-trivial intersection theorem for permutations with fixed number of cycles”, Discrete Mathematics, 339, no. 2, 2016, 646