- DANIEL R. HAWTIN, NEIL I. GILLESPIE, CHERYL E. PRAEGER, “ELUSIVE CODES IN HAMMING GRAPHS”, Bull. Aust. Math. Soc., 88, no. 2, 2013, 286
- Shalanika Dayarathna, Rajitha Senanayake, Jamie Evans, Peter Smith, 2023 IEEE International Conference on Communications Workshops (ICC Workshops), 2023, 470
- C. Ding, J. Yin, “Algebraic Constructions of Constant Composition Codes”, IEEE Trans. Inform. Theory, 51, no. 4, 2005, 1585
- Itzhak Tamo, Moshe Schwartz, “Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme”, IEEE Trans. Inform. Theory, 56, no. 6, 2010, 2551
- T.G. Swart, H.C. Ferreira, “A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings”, IEEE Trans. Inform. Theory, 52, no. 8, 2006, 3685
- Peter J. Cameron, Ian M. Wanless, “Covering radius for sets of permutations”, Discrete Mathematics, 293, no. 1-3, 2005, 91
- Cunsheng Ding, “Optimal Constant Composition Codes From Zero-Difference Balanced Functions”, IEEE Trans. Inform. Theory, 54, no. 12, 2008, 5766
- Justin Kong, Manabu Hagiwara, 2017 IEEE International Symposium on Information Theory (ISIT), 2017, 1628
- Mladen Kovacevic, Sanja Brdar, Vladimir Crnojevic, 2019 IEEE International Symposium on Information Theory (ISIT), 2019, 927
- Yonatan Yehezkeally, Moshe Schwartz, “Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation”, IEEE Trans. Inform. Theory, 2017, 1