A new metric on symmetric groups and applications to block permutation codes (Q6041587)

A family of codes have recently been subject to deeper studies: permutation codes. According to specific applications, several metrics have been proposed. In this paper the author propose a new metric, which they call cyclic block permutation metric. They also proposed some new codes to take advantage of their metric definition. It turns out that these codes improve some known results for block metric codes in [\textit{Z. Xu} et al., Des. Codes Cryptography 87, No. 11, 2625--2637 (2019; Zbl 1421.94119); \textit{S. Yang} et al., IEEE Trans. Inf. Theory 65, No. 8, 4746--4763 (2019; Zbl 1432.94181)]. Moreover, these codes beat the Gilbert-Varshamov bound (in the corresponding metrics).