A Random Local Matroid Search Algorithm to Construct Good Rate $1/p$ Systematic Binary Quasi-Cyclic Codes

摘要

In this letter, a random local matroid search algorithm is proposed to construct good rate systematic QC codes based on the relationship between the generator matrix and the minimum distance when the length of the information vector is . More than twenty new QC codes are obtained and their corresponding generator matrices are revealed, which extends previous results. Nine of these new codes have larger minimum distances than the reported ones in the previous literature.