The dimension and Bose distance of some BCH codes of length $\frac{q^{m}-1}λ$
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914382070415360 |
|---|---|
| author | Zheng, Run Sze, Nung-Sing Huang, Zejun |
| author_facet | Zheng, Run Sze, Nung-Sing Huang, Zejun |
| contents | BCH codes are important error correction codes, widely utilized due to their robust algebraic structure, multi-error correcting capability, and efficient decoding algorithms. Despite their practical importance and extensive study, their parameters, including dimension, minimum distance and Bose distance, remain largely unknown in general. This paper addresses this challenge by investigating the dimension and Bose distance of BCH codes of length $(q^m - 1)/λ$ over the finite field $\mathbb{F}_q$, where $λ$ is a positive divisor of $q - 1$. Specifically, for narrow-sense BCH codes of this length with $m \geq 4$, we derive explicit formulas for their dimension for designed distance $2 \leq δ\leq (q^{\lfloor (2m - 1)/3 \rfloor + 1} - 1)/λ + 1$. We also provide explicit formulas for their Bose distance in the range $2 \leq δ\leq (q^{\lfloor (2m - 1)/3 \rfloor + 1} - 1)/λ$. These ranges for $δ$ are notably larger than the previously known results for this class of BCH codes. Furthermore, we extend these findings to determine the dimension and Bose distance for certain non-narrow-sense BCH codes of the same length. Several optimal linear codes can be obtained from these BCH codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_02020 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The dimension and Bose distance of some BCH codes of length $\frac{q^{m}-1}λ$ Zheng, Run Sze, Nung-Sing Huang, Zejun Information Theory 11T BCH codes are important error correction codes, widely utilized due to their robust algebraic structure, multi-error correcting capability, and efficient decoding algorithms. Despite their practical importance and extensive study, their parameters, including dimension, minimum distance and Bose distance, remain largely unknown in general. This paper addresses this challenge by investigating the dimension and Bose distance of BCH codes of length $(q^m - 1)/λ$ over the finite field $\mathbb{F}_q$, where $λ$ is a positive divisor of $q - 1$. Specifically, for narrow-sense BCH codes of this length with $m \geq 4$, we derive explicit formulas for their dimension for designed distance $2 \leq δ\leq (q^{\lfloor (2m - 1)/3 \rfloor + 1} - 1)/λ + 1$. We also provide explicit formulas for their Bose distance in the range $2 \leq δ\leq (q^{\lfloor (2m - 1)/3 \rfloor + 1} - 1)/λ$. These ranges for $δ$ are notably larger than the previously known results for this class of BCH codes. Furthermore, we extend these findings to determine the dimension and Bose distance for certain non-narrow-sense BCH codes of the same length. Several optimal linear codes can be obtained from these BCH codes. |
| title | The dimension and Bose distance of some BCH codes of length $\frac{q^{m}-1}λ$ |
| topic | Information Theory 11T |
| url | https://arxiv.org/abs/2510.02020 |