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.
生成讲解博客的中文版本
生成AI智能校验的中文版本