Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory
Designs, Codes and Cryptography
| Hi-index | 754.84 |
Twelve new quasi-cyclic (QC) codes are presented which improve the bounds on the best known binary linear codes. They are rate (m-r)/pm, r>1, codes constructed by deleting r rows from the circulant matrices of rate m/pm QC codes, based on the factors of xm-1. Heuristic combinatorial optimization was used to find these codes