English

A Class of Narrow-Sense BCH Codes

Information Theory 2019-02-13 v1 math.IT

Abstract

BCH codes are an important class of cyclic codes which have applications in satellite communications, DVDs, disk drives, and two-dimensional bar codes. Although BCH codes have been widely studied, their parameters are known for only a few special classes. Recently, Ding et al. made some new progress in BCH codes. However, we still have very limited knowledge on the dimension of BCH codes, not to mention the weight distribution of BCH codes. In this paper, we generalize the results on BCH codes from several previous papers. The dimension of narrow-sense BCH codes of length qm1λ\frac{q^m-1}{\lambda} with designed distance 2δq(m+1)/21λ+12\leq \delta \leq \frac{q^{\lceil(m+1)/2 \rceil}-1}\lambda+1 is settled, where λ\lambda is any factor of q1q-1. The weight distributions of two classes of narrow-sense BCH codes of length qm12\frac{q^m-1}2 with designed distance δ=(q1)qm1q(m1)/212\delta=\frac{(q-1)q^{m-1}-q^{\lfloor(m-1)/2\rfloor}-1}2 and δ=(q1)qm1q(m+1)/212\delta=\frac{(q-1)q^{m-1}-q^{\lfloor(m+1)/2\rfloor}-1}2 are determined. The weight distribution of a class of BCH codes of length qm1q1\frac{q^m-1}{q-1} is determined. In particular, a subclass of this class of BCH codes is optimal with respect to the Griesmer bound. Some optimal linear codes obtained from this class of BCH codes are characterized.

Keywords

Cite

@article{arxiv.1902.04372,
  title  = {A Class of Narrow-Sense BCH Codes},
  author = {Shixin Zhu and Zhonghua Sun and Xiaoshan Kai},
  journal= {arXiv preprint arXiv:1902.04372},
  year   = {2019}
}
R2 v1 2026-06-23T07:38:41.110Z