Weight distributions of some binary primitive cyclic codes

J. Wolfmann · IEEE Transactions on Information Theory · 1994

Let s and k be integers such that s is a divisor of 2/sup k/-1. Let g(x) be a divisor of x/sup s/-1 over F/sub 2/, and let /spl pi/(x) be a primitive polynomial of degree k over F/sub 2/. We consider the binary cyclic code C of length N=2/sup k/-1 generated by (X/sup N/-1)/g(x)/spl pi/(x). For special cases, we determine the weight distribution of C by using the weights of the cyclic code of length s generated by (x/sup s/-1)/g(x).>

Read the paper · More papers on PaperTik