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

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

2010-02-12

arxiv.org/abs/1002.2456v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-419586