Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
Cunsheng Ding, Tor Helleseth · IEEE Transactions on Information Theory · 1999
We first introduce a generalized cyclotomy of order 2 with respect to p/sub 1//sup e(1)/...p/sub t//sup e(t)/. We then present two classes of new error-correcting binary cyclic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/ based on this generalized cyclotomy. We prove either a square-root bound or a similar bound on the minimum odd weight of those codes with length n=p/sub 1//sup e(1)/ p/sub 2//sup e(2)/.