2020 Volume 9 Issue 12 Pages 668-673
In this paper, we consider the reversibility problem in the class of quasi-cyclic (QC) codes Q over Fq of length nℓ and index ℓ generated by unfolding cyclic codes C over Fqℓ of length n. We prove a necessary and sufficient condition on C that ensures the reversibility of Q. Using computer search, we offer some good reversible QC codes that are generated by unfolding cyclic codes.