Showing 2026Show all
2 papers · 1 filter
cs.IT2026
On Nearly-Perfect Covering Codes Beyond Radius One
Gabriel Sac Himelfarb, Moshe Schwartz
We study (binary) nearly-perfect covering codes, which are codes that attain the Van Wee bound with equality. They act as the covering counterparts to nearly-perfect error-correcti…
cs.IT2026
On the burst-covering radius of binary cyclic codes
Gabriel Sac Himelfarb, Moshe Schwartz
We define and study burst-covering codes. We provide some general bounds connecting the parameters of a code with its burst-covering radius. We then provide stronger bounds on the…