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 g...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yildiz Technical University
2017-07-01
|
| Series: | Journal of Algebra Combinatorics Discrete Structures and Applications |
| Online Access: | http://jacodesmath.com/index.php/jacodesmath/article/view/142 |