Two classes of narrow-sense BCH codes and their duals

Xiaoqiang Wang, Jiaojiao Wang, Chengju Li, Yansheng WuIEEE Trans. Information Theory 2022

TL;DR

This paper investigates narrow-sense BCH codes and their duals, focusing on conditions that make them "dually-BCH" (meaning both the code and its dual are BCH codes). The authors provide new criteria for this property and establish lower bounds on the minimum distances of the dual codes, extending previous work and resolving open problems in the field.

What Problem Does This Paper Address?

BCH codes are a fundamental class of error-correcting codes with excellent performance. While much is known about BCH codes themselves, their dual codes (which are also cyclic codes) have been less understood, particularly regarding their minimum distances. The concept of "dually-BCH" codes was introduced to study these duals, but a complete characterization, especially for certain code lengths, remained elusive. This paper aims to fill this gap by providing necessary and sufficient conditions for BCH codes to be dually-BCH and by deriving tighter lower bounds on the minimum distances of their duals for specific code lengths.

Methods

The paper employs a combination of algebraic coding theory techniques. Key methods include:

  • Cyclotomic Cosets: Analyzing the structure of BCH codes relies heavily on understanding cyclotomic cosets, which are used to define the generator polynomials and the defining sets of codes.
  • Generator and Check Polynomials: The relationship between generator polynomials, check polynomials, and the roots of unity is central to defining and analyzing cyclic codes like BCH codes.
  • Coset Leaders: The concept of coset leaders within cyclotomic cosets is crucial for determining code properties, including minimum distances and the dually-BCH condition.
  • Algebraic Manipulation: The proofs involve extensive algebraic manipulation of field elements, polynomials, and their properties within finite fields GF(q).
  • Case Analysis: Many results are derived through careful case analysis based on parameters like the field size $q$, the extension degree $m$, and the designed distance $\delta$.

Datasets

Not discussed in the paper. The paper focuses on theoretical aspects of coding theory rather than empirical evaluation on specific datasets.

Key Insights and Ideas

  • Characterizing Dually-BCH Codes: The paper provides precise conditions for when a narrow-sense BCH code is also a dually-BCH code. This is a significant step towards a complete understanding of these code families.
  • Lower Bounds on Dual Distances: New and improved lower bounds for the minimum distances of dual BCH codes are established, particularly for codes of length $n = \frac{q^m-1}{q+1}$. These bounds are crucial for assessing the error-correcting capabilities of these dual codes.
  • Resolving Conjectures: The work directly addresses and resolves a conjecture related to the largest coset leader modulo $n = \frac{q^m-1}{q+1}$, which was posed in previous research.
  • Unified Approach: The paper extends results previously known only for specific fields (like binary or ternary) to more general prime power fields, offering a more unified theoretical framework.

Key Results

  • The paper establishes sufficient and necessary conditions for BCH codes of length $n = \frac{q^m-1}{q+1}$ to be dually-BCH codes.
  • Lower bounds on the minimum distances of the dual codes are derived for $n = \frac{q^m-1}{q+1}$.
  • The largest coset leader modulo $n = \frac{q^m-1}{q+1}$ is determined, proving a conjecture from [28].
  • The paper provides a complete characterization for dually-BCH codes of length $n = \frac{q^m-1}{q+1}$ for $q > 3$, extending prior work.
  • Examples are given that demonstrate the tightness of the derived lower bounds, showing that some of the resulting codes are optimal or near-optimal.

Limitations and Future Work

  • Specific Code Lengths: While the paper makes significant progress, the focus is primarily on BCH codes of specific lengths, namely $n = \frac{q^m-1}{q+1}$ and $n = \frac{q^m-1}{q-1}$. Extending these results to other lengths could be a future direction.
  • Generalization: While the paper generalizes some results from binary/ternary to general prime powers, further exploration into other code families or more complex scenarios might be beneficial.
  • Optimality: The paper shows that some derived codes are "almost optimal." Determining exact minimum distances for all cases and proving optimality for a wider range of parameters remains an ongoing challenge in coding theory.

Summary updated

BibTeX
@article{wang2022two,
  author = {Xiaoqiang Wang and Jiaojiao Wang and Chengju Li and Yansheng Wu},
  title = {{Two classes of narrow-sense BCH codes and their duals}},
  journal = {IEEE Trans. Information Theory},
  year = {2022},
}
Figure