Emergent Mind

Dimensions of three types of BCH codes over GF(q)

(1608.03027)
Published Aug 10, 2016 in cs.IT and math.IT

Abstract

BCH codes have been studied for over fifty years and widely employed in consumer devices, communication systems, and data storage systems. However, the dimension of BCH codes is settled only for a very small number of cases. In this paper, we study the dimensions of BCH codes over finite fields with three types of lengths $n$, namely $n=qm-1$, $n=(qm-1)/(q-1)$ and $n=qm+1$. For narrow-sense primitive BCH codes with designed distance $\delta$, we investigate their dimensions for $\delta$ in the range $1\le \delta \le q{\lceil\frac{m}{2}\rceil+1}$. For non-narrow sense primitive BCH codes, we provide two general formulas on their dimensions and give the dimensions explicitly in some cases. Furthermore, we settle the minimum distances of some primitive BCH codes. We also explore the dimensions of the BCH codes of lengths $n=(qm-1)/(q-1)$ and $n=qm+1$ over finite fields.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.