A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
In this paper, we consider the reversibility problem in the class of quasi-cyclic (QC) codes Q over F q of length nℓ and index ℓ generated by unfolding cyclic codes C over F q ℓ 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.doi:10.1587/comex.2020xbl0117 fatcat:gprkbxnm3nadhbfnflx3yoa7ve