Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory
Designs, Codes and Cryptography
| Hi-index | 754.84 |
Some optimal rate-frac{1}{2}quasi-cyclic codes found by Chert et aL [3] are grouped into a small set of equivalence classes with the assistance of a computer. The weight distribution of a selection of these rate-frac{1}{2}codes is tabulated. In addition, a list of new optimal rate-frac{2}{3}quasi-cyclic codes of lengths up to 54 is presented.