2022/08/30 by Anuj Kumar Bhagat, Bhagat, Anuj Kumar, Ritumoni Sarma +1
Computer Science · Engineering · #11T71 #94B05 #94B25 #94B60 #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2208.14287
openalex publication_date 2022/08/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.