广义的凯莱距离下的多重置换码上下界

Bounds of Mulipermutation Codes in the Generalized Cayley Distance

主要研究r正则多重置换码在广义的凯莱距离下的理论大小问题.由于计算两个多重置换码之间的距离十分复杂,引进了块置换距离来做距离嵌入.最后得到了关于r正则多重置换码在广义的凯莱距离下的上下界.

We address the problem of r regular multipermutation codes’size under the generalized Cayley distance.Because it is difficult to calculate the generalized Caylay distance,we introduce the block permutation distance for metric embedding.Lastly,we derive the upper bound and lower bound of r regular multipermutation codes under the generalized Cayley distance.