2000 character limit reached
Two types of narrow-sense negacyclic BCH codes
Published 24 Jul 2023 in cs.IT and math.IT | (2307.12762v2)
Abstract: Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in most cases, but their parameters are hard to determine. In this paper, we mainly study two types of negacyclic BCH codes of length $n=\frac{q{m}-1}{4},\frac{q{m}+1}{4}$, and give their dimensions and the lower bound on their minimum distance. Furthermore, we provide the weight distribution of narrow-sense neagcyclic BCH codes of length $n=\frac{qm-1}{4}$ for some special designed distances.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.