SOME RESULTS ON BCH CODES OF LENGTH qm+1 2

摘要

BCH codes are an especially important kind of cyclic codes, which are extensively used in many domains such as communication and storage systems. Determining the dimensions of BCH codes is a challenging problem in coding theory. In this paper, we study BCH codes of length qm+1 2 , for odd m and m equivalent to 2(mod 4). The first few largest coset leaders of such BCH codes are obtained. On the basis of this, we determine their parameters and obtain a few optimal or almost optimal codes.

关键词