Infinity-Norm Permutation Covering Codes from Cyclic Groups
Information Theory
2017-03-03 v1 math.IT
Abstract
We study covering codes of permutations with the -metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering radius, and showing linear-time algorithms for finding a covering codeword. We also bound the covering radius of relabeled cyclic transitive groups under conjugation.
Keywords
Cite
@article{arxiv.1703.00500,
title = {Infinity-Norm Permutation Covering Codes from Cyclic Groups},
author = {Ronen Karni and Moshe Schwartz},
journal= {arXiv preprint arXiv:1703.00500},
year = {2017}
}