Anuj Kumar Bhagat, Ritumoni Sarma·2022-08-30·via cs.IT updates on arXiv.org
We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.