Infinity-norm permutation covering codes from cyclic groups

DOI10.1109/TIT.2017.2766296MaRDI QIDQ4682831zbMATH OpenDBLPWikidataFDO

Authors

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.00500

Mathematics Subject Classification ID

Symmetric groups (20B30) Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Abstract: We study covering codes of permutations with the $el{l}_{i}nfty$-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.

Recommendations

• Covering radius of permutation groups with infinity-norm
• A random construction for permutation codes and the covering radius
• Covering radius for sets of permutations
• Remoteness of permutation codes
• Permutation codes with specified packing radius

Cited in

(3)

• Covering radius of permutation groups with infinity-norm
• A random construction for permutation codes and the covering radius
• Uncoverings-by-bases for base-transitive permutation groups.

This page was built for publication: Infinity-norm permutation covering codes from cyclic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682831)