Determination of Minimum Weight for Binary Cyclic Codes

The aim of this work to solve the problem of determining the minimum weight of binary cyclic codes. Since knowledge of this weight is necessary for the efficiency of the code in detecting error in stored or transferred digital data. This problem was solved by designing an efficient algorithm. This algorithm depends on new results obtained in this works. The algorithm needs only few codewords to calculate its weights. These codewords are chosen by some procedure after deciding their weight exactly. This number of codewords is also used in deciding the algorithm order of complexity by obtaining an indication of its running time.