Reolyn Heymann, Jos H. Weber, Theo G. Swart, Hendrik C. Ferreira, 2014 IEEE Information Theory Workshop (ITW 2014), 2014, 576
Jen-Chun Chang, Rong-Jaye Chen, T. Klove, Shi-Chun Tsai, “Distance-preserving mappings from binary vectors to permutations”, IEEE Trans. Inform. Theory, 49, no. 4, 2003, 1054
Yen-Ying Huang, Shi-Chun Tsai, Hsin-Lung Wu, “On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations”, Des Codes Crypt, 40, no. 2, 2006, 139
F.-W. Fu, T. Klove, “Two Constructions of Permutation Arrays”, IEEE Trans. Inform. Theory, 50, no. 5, 2004, 881
Sergey Bereg, Peter J. Dukes, “A lower bound on permutation codes of distance $n-1$”, Des. Codes Cryptogr., 88, no. 1, 2020, 63
Zihan Zhang, “A new metric on symmetric groups and applications to block permutation codes”, Des. Codes Cryptogr., 91, no. 6, 2023, 2255
C.J. Colbourn, T. Klove, A.C.H. Ling, “Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares”, IEEE Trans. Inform. Theory, 50, no. 6, 2004, 1289
Giacomo Micheli, Alessandro Neri, “New Lower Bounds for Permutation Codes Using Linear Block Codes”, IEEE Trans. Inform. Theory, 66, no. 7, 2020, 4019
Cunsheng Ding, “Optimal Constant Composition Codes From Zero-Difference Balanced Functions”, IEEE Trans. Inform. Theory, 54, no. 12, 2008, 5766
Mathieu Bogaerts, Peter Dukes, “Semidefinite programming for permutation codes”, Discrete Mathematics, 326, 2014, 34