On the exponent of cyclic codes
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.