Good reversible quasi-cyclic codes via unfolding cyclic codes
Keywords:
Reciprocal polynomial,
binary code,
computer search,
best known parameters,
minimum distance.
Article ID: 2020XBL0117
Details
Article ID: 2020XBL0117
In this paper, we consider the reversibility problem in the class of quasi-cyclic (QC) codes Q over Fq of length nl and index l generated by unfolding cyclic codes C over Fql 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.
