The dimension and Bose distance of some BCH codes of length (qm − 1)/λ

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 Fq, where λ is a positive divisor of q − 1. Specifically, for narrow-sense BCH codes of this length with m ≥ 4, we derive explicit formulas for their dimension for designed distance 2 ≤ δ ≤ (q ⌊(2m−1)/3⌋+1 − 1)/λ + 1. We also provide explicit formulas for their Bose distance in the range 2 ≤ δ ≤ (q ⌊(2m−1)/3⌋+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. Applying our results, we identify several BCH codes with good parameters.

Authors

Publication Details

Published
2025-10-07
DOI
https://doi.org/10.36227/techrxiv.175988062.26727107/v1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The dimension and Bose distance of some BCH codes of length (qm − 1)/λ

Nung-Sing Sze, Run Zheng, Zejun Huang
Coding theory and cryptography
article

The dimension and Bose distance of some BCH codes of length (qm − 1)/λ

Nung-Sing Sze, Run Zheng, Zejun Huang
article en

Abstract

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 Fq, where λ is a positive divisor of q − 1. Specifically, for narrow-sense BCH codes of this length with m ≥ 4, we derive explicit formulas for their dimension for designed distance 2 ≤ δ ≤ (q ⌊(2m−1)/3⌋+1 − 1)/λ + 1. We also provide explicit formulas for their Bose distance in the range 2 ≤ δ ≤ (q ⌊(2m−1)/3⌋+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. Applying our results, we identify several BCH codes with good parameters.

National Natural Science Foundation of China, Hong Kong Polytechnic University
Openalex Percentile: Top 85%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.