The second generalized covering radius of binary primitive double-error-correcting BCH codes

Lev Yohananov; Moshe Schwartz

doi:10.1016/j.ffa.2025.102648

The second generalized covering radius of binary primitive double-error-correcting BCH codes

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1016/j.ffa.2025.102648
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

Access to Document

10.1016/j.ffa.2025.102648

Cite this

@article{acf11f454e1349c5b12abbb516abb29a,

title = "The second generalized covering radius of binary primitive double-error-correcting BCH codes",

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.",

keywords = "BCH codes, Generalized covering radius, Linear codes",

author = "Lev Yohananov and Moshe Schwartz",

note = "Publisher Copyright: {\textcopyright} 2025 Elsevier Inc.",

year = "2025",

month = oct,

day = "1",

doi = "10.1016/j.ffa.2025.102648",

language = "English",

volume = "107",

journal = "Finite Fields and their Applications",

issn = "1071-5797",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - The second generalized covering radius of binary primitive double-error-correcting BCH codes

AU - Yohananov, Lev

AU - Schwartz, Moshe

PY - 2025/10/1

Y1 - 2025/10/1

N2 - 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.

AB - 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.

KW - BCH codes

KW - Generalized covering radius

KW - Linear codes

UR - http://www.scopus.com/inward/record.url?scp=105004258367&partnerID=8YFLogxK

U2 - 10.1016/j.ffa.2025.102648

DO - 10.1016/j.ffa.2025.102648

M3 - Article

AN - SCOPUS:105004258367

SN - 1071-5797

VL - 107

JO - Finite Fields and their Applications

JF - Finite Fields and their Applications

M1 - 102648

ER -

The second generalized covering radius of binary primitive double-error-correcting BCH codes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this