Equivalent rate 1/2 quasi-cyclic codes (Corresp.)
J. Stein, V.K. Bhargava · IEEE Transactions on Information Theory · 1975
Chen et al. [1] give a list of quasi-cyclic (2m,m) codes which have the largest minimum distance of any quasi-cyclic code, for various values ofm. We present the weight distribution of these codes. It will be seen that many of the codes found by Chen et al. [1] are equivalent in the sense of having identical weight distributions.