2018年3月4日
On a characterization of a state of rank-modulation scheme over multi-cell ranking by a group action
Japan-Singapore Workshop on Coding and Information Theory
- 記述言語
- 英語
- 会議種別
- シンポジウム・ワークショップ パネル(公募)
- 主催者
- School of Physical & Mathematical Sciences, Nanyang Technological University
- 開催地
- Singapore
In this talk, a group theoretic representation suitable for the
rank-modulation (RM) scheme over the multi-cell ranking developed by
En Gad et al. is presented. By introducing an action of the group of
all permutation matrices on the set of all permutations, the scheme is
clearly reformulated. Moreover, we introduce the concept of
r-dominating sets over the multi-cell ranking, which is a
generalization of conventional dominating sets, in the design of
rank-modulation rewriting codes. The concept together with the
presented group theoretic representation helps to yield an explicit
formula of an upper bound on the size of the set of messages that can
be stored in the memory by using RM rewriting codes over multi-cell
ranking. We also note that this bound enables us to consider the
trade-off between the size of the storable message set and the
rewriting cost more closely.
rank-modulation (RM) scheme over the multi-cell ranking developed by
En Gad et al. is presented. By introducing an action of the group of
all permutation matrices on the set of all permutations, the scheme is
clearly reformulated. Moreover, we introduce the concept of
r-dominating sets over the multi-cell ranking, which is a
generalization of conventional dominating sets, in the design of
rank-modulation rewriting codes. The concept together with the
presented group theoretic representation helps to yield an explicit
formula of an upper bound on the size of the set of messages that can
be stored in the memory by using RM rewriting codes over multi-cell
ranking. We also note that this bound enables us to consider the
trade-off between the size of the storable message set and the
rewriting cost more closely.