The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)
An Upper Bound on the Generalized Cayley Distance
Akira Yamawaki, Hiroshi Kamabe, Shan Lu,
Permutation codes with various metrics have recently been studied for flash memory applications. In this work, we derive a tighter upper bound on the generalized Cayley distance using the block permutation distance proposed by Yang, Schoeny, and Dolecek. Furthermore, we employ our upper bound to derive a tighter upper bound on the optimal rate for codes with the generalized Cayley distance when the code length is relatively small.