EUVIMEDOpdag EUVIMED
Open access · CC BY 4.0

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

Kenza Guenda, T. Aaron Gulliver

Journal of Algebra Combinatorics Discrete Structures and Applications · 2017-09-15 · 4 (3) · 261-269

DOI: 10.13069/jacodesmath.327375 ↗

At a glance

Journal article in Journal of Algebra Combinatorics Discrete Structures and Applications, published online on 2017-09-15. Written by Kenza Guenda and 1 co-authors. Cited 4 times so far (Crossref). The full text is freely available (open access, CC BY 4.0).

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

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.

Cite

APA

Guenda, K., & Gulliver, T. A. (2017). On the equivalence of cyclic and quasi-cyclic codes over finite fields. Journal of Algebra Combinatorics Discrete Structures and Applications, 4(3), 261-269. https://doi.org/10.13069/jacodesmath.327375

Vancouver

Guenda K, Gulliver TA. On the equivalence of cyclic and quasi-cyclic codes over finite fields. Journal of Algebra Combinatorics Discrete Structures and Applications. 2017;4(3):261-269. doi:10.13069/jacodesmath.327375

BibTeX
@article{Guenda2017,
  author = {Guenda, Kenza and Gulliver, T. Aaron},
  title = {On the equivalence of cyclic and quasi-cyclic codes over finite fields},
  journal = {Journal of Algebra Combinatorics Discrete Structures and Applications},
  year = {2017},
  volume = {4},
  number = {3},
  pages = {261--269},
  doi = {10.13069/jacodesmath.327375}
}
Start for free →