Abstract
We completely determine the second covering radius for binary primitive double-error-correcting BCH codes. As part of this process, we provide a lower bound on the second covering radius for binary primitive BCH codes correcting more than two errors.
| Original language | English |
|---|---|
| Article number | 102648 |
| Journal | Finite Fields and their Applications |
| Volume | 107 |
| DOIs | |
| State | Published - 1 Oct 2025 |
Keywords
- BCH codes
- Generalized covering radius
- Linear codes
ASJC Scopus subject areas
- Theoretical Computer Science
- Algebra and Number Theory
- General Engineering
- Applied Mathematics