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

Hao Liu, Cunsheng Ding, Chengju Li

Research output: Contribution to journalArticlepeer-review

63 Scopus citations

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 δ, we investigate their dimensions for δ in the range 1≤δ≤q⌈⌉+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.

Original languageEnglish
Pages (from-to)1910-1927
Number of pages18
JournalDiscrete Mathematics
Volume340
Issue number8
DOIs
StatePublished - 1 Aug 2017

Keywords

  • BCH code
  • Cyclic code
  • Linear code
  • Reversible cyclic code

Fingerprint

Dive into the research topics of 'Dimensions of three types of BCH codes over GF(q)'. Together they form a unique fingerprint.

Cite this