- Moshe Schwartz, Pascal O. Vontobel, “Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric”, IEEE Trans. Inform. Theory, 63, № 10, 2017, 6227
- T.G. Swart, H.C. Ferreira, “A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings”, IEEE Trans. Inform. Theory, 52, № 8, 2006, 3685
- János Barta, Roberto Montemanni, “The Maximum Clique Problem for Permutation Hamming Graphs”, J Optim Theory Appl, 194, № 2, 2022, 492
- Yeow Meng Chee, Van Khu Vu, 2014 IEEE International Symposium on Information Theory, 2014, 2959
- Sergey Bereg, Linda Morales, I. Hal Sudborough, “Extending permutation arrays: improving MOLS bounds”, Des. Codes Cryptogr., 83, № 3, 2017, 661
- Lucia Moura, Gary L. Mullen, Daniel Panario, “Finite field constructions of combinatorial arrays”, Des. Codes Cryptogr., 78, № 1, 2016, 197
- Derek H. Smith, Roberto Montemanni, “Permutation codes with specified packing radius”, Des. Codes Cryptogr., 69, № 1, 2013, 95
- Janos Barta, Roberto Montemanni, Derek H. Smith, 2014 2nd International Conference on Information and Communication Technology (ICoICT), 2014, 187
- Lingfei Jin, “A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound”, IEEE Trans. Inform. Theory, 62, № 1, 2016, 159
- Peter J. Dukes, Ferdinand Ihringer, Nathan Lindzey, “On the Algebraic Combinatorics of Injections and its Applications to Injection Codes”, IEEE Trans. Inform. Theory, 66, № 11, 2020, 6898