Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory
Designs, Codes and Cryptography
| Hi-index | 754.84 |
Without recourse to the normal basis theorem, some(mk, k)cyclic codes are put into quasi-cyclic form, and their weight distributions are obtained. As a special case, some(3p,p)codes of Karlin are examined. It is shown that the dual(3p,2p)codes have minimum distance of at most six.