




















Despite the theoretical and practical significance of BCH codes, the exact minimum distance and dimension remain unknown for many families. This paper establishes the precise minimum distance and dimension of narrow-sense BCH codes $\C_{(q, m, λ, \ell_0, \ell_1)}$ over $\gf(q)$ of length $\frac{q^m-1}λ$ and designed distance $\frac{(q-λ\ell_0)q^{m-1-\ell_1}-1}λ$, where $λ\mid (q-1)$, $0\leq \ell_0< \frac{q-1}λ$, and $0\leq \ell_1\leq m-1$. These results conclusively resolve the three open problems posed by Li et al. (IEEE Trans. Inf. Theory, vol. 63, no. 11, pp. 7219-7236, Nov. 2017) while establishing complementary advances to Ding's seminal framework (IEEE Trans. Inf. Theory, vol. 61, no. 10, pp. 5322-5330, Oct. 2015).
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。