pith. sign in

arxiv: 1002.2456 · v1 · submitted 2010-02-12 · 💻 cs.IT · math.GR· math.IT

The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic Codes

Kenza Guenda This is my paper
classification 💻 cs.IT math.GRmath.IT
keywords codescyclicgroupsequivalentfindfinitepermutationpermutations
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure

    quant-ph 2026-06 unverdicted novelty 7.0

    GB codes are expressed as cyclic submodules of R_ℓ² to derive necessary and sufficient conditions for block-separable automorphisms and fold-transversal gates, with the new MCR family demonstrated to generate the 2-qu...