On the permutation groups of cyclic codes

From MaRDI portal
Publication:356726

DOI10.1007/S10801-012-0399-4zbMATH Open1273.94405arXiv1002.2456OpenAlexW1980470481MaRDI QIDQ356726FDOQ356726


Authors: Kenza Guenda, T. Aaron Gulliver Edit this on Wikidata


Publication date: 26 July 2013

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two cyclic codes of length p^r can be equivalent. We also find the set of permutations by which two quasi-cyclic codes can be equivalent.


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




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: On the permutation groups of cyclic codes

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