TY - JOUR

T1 - On the labeling problem of permutation group codes under the infinity metric

AU - Tamo, Itzhak

AU - Schwartz, Moshe

PY - 2012

Y1 - 2012

N2 - We consider codes over permutations under the infinity norm. Given such a code, we show that a simple relabeling operation, which produces an isomorphic code, may drastically change the minimal distance of the code. Thus, we may choose a code structure for efficient encoding procedures, and then optimize the code's minimal distance via relabeling. To establish that the relabeling problem is hard and is of interest, we formally define it and show that all codes may be relabeled to get a minimal distance at most 2. On the other hand, the decision problem of whether a code may be relabeled to distance 2 or more is shown to be NP-complete, and calculating the best achievable minimal distance after relabeling is proved to be hard to approximate up to a factor of 2. We then consider general bounds on the relabeling problem. We specifically construct the optimal relabeling for transitive cyclic groups. We conclude with the main resulta general probabilistic bound, which we then use to show both the \mathop{\rm AGL}(p) group and the dihedral group on p elements may be relabeled to a minimal distance of p-O(\sqrt{p\ln p}).

AB - We consider codes over permutations under the infinity norm. Given such a code, we show that a simple relabeling operation, which produces an isomorphic code, may drastically change the minimal distance of the code. Thus, we may choose a code structure for efficient encoding procedures, and then optimize the code's minimal distance via relabeling. To establish that the relabeling problem is hard and is of interest, we formally define it and show that all codes may be relabeled to get a minimal distance at most 2. On the other hand, the decision problem of whether a code may be relabeled to distance 2 or more is shown to be NP-complete, and calculating the best achievable minimal distance after relabeling is proved to be hard to approximate up to a factor of 2. We then consider general bounds on the relabeling problem. We specifically construct the optimal relabeling for transitive cyclic groups. We conclude with the main resulta general probabilistic bound, which we then use to show both the \mathop{\rm AGL}(p) group and the dihedral group on p elements may be relabeled to a minimal distance of p-O(\sqrt{p\ln p}).

KW - Error-correcting codes

KW - group codes

KW - permutations

KW - rank modulation

UR - http://www.scopus.com/inward/record.url?scp=84866521644&partnerID=8YFLogxK

U2 - 10.1109/TIT.2012.2204035

DO - 10.1109/TIT.2012.2204035

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84866521644

SN - 0018-9448

VL - 58

SP - 6595

EP - 6604

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 10

M1 - 6214605

ER -