- Khmaies Ouahada, Theo G. Swart, Hendrik C. Ferreira, Ling Cheng, “Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes”, Des. Codes Cryptogr., 48, № 2, 2008, 141
- Moshe Schwartz, 2010 IEEE International Symposium on Information Theory, 2010, 869
- 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
- Alexander Barg, Arya Mazumdar, “Codes in Permutations and Error Correction for Rank Modulation”, IEEE Trans. Inform. Theory, 56, № 7, 2010, 3158
- Patrick Solé, “The covering radius of permutation designs”, J Algebr Comb, 57, № 1, 2023, 305
- Peter J. Cameron, “Permutation codes”, European Journal of Combinatorics, 31, № 2, 2010, 482
- Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic, 2012 IEEE International Symposium on Information Theory Proceedings, 2012, 2988
- Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, I. H. Sudborough, “New lower bounds for permutation arrays using contraction”, Des. Codes Cryptogr., 87, № 9, 2019, 2105
- Faruk Gologlu, Juri Lember, Ago-Erik Riet, Vitaly Skachek, 2015 IEEE International Symposium on Information Theory (ISIT), 2015, 1726
- Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck, “Correcting Charge-Constrained Errors in the Rank-Modulation Scheme”, IEEE Trans. Inform. Theory, 56, № 5, 2010, 2112