Computer Science, Information Theory, Information Theory (cs.IT)

journal:

--

date:

2024-01-26 00:00:00

Abstract

BCH codes form an important subclass of cyclic codes, and are widely used in compact discs, digital audio tapes and other data storage systems to improve data reliability. As far as we know, there are few results on $q$-ary BCH codes of length $n=\frac{q^{m}+1}{q+1}$. This is because it is harder to deal with BCH codes of such length. In this paper, we study $q$-ary BCH codes with lengths $n=\frac{q^{m}+1}{q+1}$ and $n=q^m+1$. These two classes of BCH codes are always LCD codes. For $n=\frac{q^{m}+1}{q+1}$, the dimensions of narrow-sense BCH codes of length $n$ with designed distance $\delta=\ell q^{\frac{m-1}{2}}+1$ are determined, where $q>2$ and $2\leq \ell \leq q-1$. Moreover, the largest coset leader is given for $m=3$ and the first two largest coset leaders are given for $q=2$. The parameters of BCH codes related to the first few largest coset leaders are investigated. Some binary BCH codes of length $n=\frac{2^m+1}{3}$ have optimal parameters. For ternary narrow-sense BCH codes of length $n=3^m+1$, a lower bound on the minimum distance of their dual codes is developed, which is good in some cases.