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

August 10, 2016 Β· Declared Dead Β· πŸ› Discrete Mathematics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Hao Liu, Cunsheng Ding, Chengju Li arXiv ID 1608.03027 Category cs.IT: Information Theory Citations 77 Venue Discrete Mathematics Last Checked 5 months ago
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=q^m-1$, $n=(q^m-1)/(q-1)$ and $n=q^m+1$. For narrow-sense primitive BCH codes with designed distance $Ξ΄$, we investigate their dimensions for $Ξ΄$ in the range $1\le Ξ΄\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=(q^m-1)/(q-1)$ and $n=q^m+1$ over finite fields.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted