On the exponent of cyclic codes
Anuj Kumar Bhagat, Ritumoni Sarma
TL;DR
This paper introduces an algorithm to estimate the minimum number of cyclic codes with a specified exponent over finite fields and provides a formula to determine the exponent of BCH codes.
Contribution
It presents a novel algorithm for lower bounds on cyclic codes and a formula for BCH code exponents, advancing coding theory methods.
Findings
Algorithm for lower bounds on cyclic codes
Formula for BCH code exponents
Enhanced understanding of cyclic code properties
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cryptographic Implementations and Security