On the equivalence of cyclic and quasi-cyclic codes over finite fields

This paper studies the equivalence problem for cyclic codes of length p^r and quasi-cyclic codes of length p^rl. in particular, we generalize the results of huffman, job, and pless (j. combin. theory. a, 62, 183–215, 1993), who considered the special case p^2. this is achieved by explicitly giving the permutations by which two cyclic codes of prime power length are equivalent. this allows us to obtain an algorithm which solves the problem of equivalency for cyclic codes of length p^r in polynomial time. further, we characterize the set by which two quasi-cyclic codes of length p^rl can be equivalent, and prove that the affine group is one of its subsets.