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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.