2021/09/28 by Hongwei Zhu, Zhu, Hongwei, Minjia Shi +5 · 1 citation
Computer Science · Social Sciences · #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Islamic Finance and Communication #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2109.13803
openalex publication_date 2021/09/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite fields and analyse their parameters. Some lower bounds on the minimum distance of antiprimitive BCH codes are given. The BCH codes presented in this paper have good parameters in general, containing many optimal linear codes. In particular, two open problems about the minimum distance of BCH codes of this type are partially solved in this paper.