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{q^m-1}{4}$ for some special designed distances.

翻译：负循环BCH码是负循环码的重要子类，在多数情况下是最优线性码，但其参数难以确定。本文主要研究长度为$n=\frac{q^{m}-1}{4}$和$\frac{q^{m}+1}{4}$的两类负循环BCH码，给出其维数及最小距离的下界。此外，针对若干特殊设计距离，我们给出了长度为$n=\frac{q^m-1}{4}$的窄义负循环BCH码的重量分布。