Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-PM-1-1
Session:
Number:We-PM-1-1.4
An Upper Bound on the Generalized Cayley Distance
Akira Yamawaki, Hiroshi Kamabe, Shan Lu,
pp.632-636
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-PM-1-1.4
PDF download
Summary:
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.