跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.18156 · v1

Hamming and Johnson-Type Bounds for Joint Error Correction and Detection

首次提交 2026-11-13 21:31
版本更新 2026-11-13 21:31
雷达观测 2026-11-16 11:41
arXiv ↗PDF ↗

摘要

We derive upper bounds on the size of codes for joint error correction and detection over classical qq-ary Hamming spaces. A (c,c′)(c,c') joint error correcting and detecting code corrects every error of weight at most cc and detects every error whose weight lies between c+1c+1 and c+c′c+c'. We establish equivalent conditions for this decoding requirement using Hamming balls and Hamming rings, and derive a joint bound that reduces to the Hamming bound when c′=0c'=0. We introduce joint perfect codes and show that binary repetition codes attain the joint bound whenever n=2c+c′+1n=2c+c'+1. For codes satisfying dmin⁡=2c+c′+1d_{\min}=2c+c'+1, we investigate an alternative joint bound based on ring multiplicity and constant-weight code bounds. A further argument using the Cauchy-Schwarz inequality and pairwise ring intersections yields a refined joint bound that is always at least as strong as the original joint bound. We then incorporate an additional outer Hamming shell to obtain a Johnson-type extension. This extension provides a strict improvement for binary codes with c′=1c'=1, dmin⁡=2c+2d_{\min}=2c+2, c≥2c\geq2, and dmin⁡+2≤n≤3dmin⁡/2−1d_{\min}+2\leq n\leq3d_{\min}/2-1. These results connect sphere-packing bounds with the geometry of joint error correction and detection.

作者备注:This manuscript is a preliminary draft and is currently being revised. The final version will be posted once the revisions are complete. Comments and suggestions are welcome

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 21:31 · 最新观测版本

Hamming and Johnson-Type Bounds for Joint Error Correction and Detection

We derive upper bounds on the size of codes for joint error correction and detection over classical qq-ary Hamming spaces. A (c,c′)(c,c') joint error correcting and detecting code corrects every error of weight at most cc and detects every error whose weight lies between c+1c+1 and c+c′c+c'. We establish equivalent conditions for this decoding requirement using Hamming balls and Hamming rings, and derive a joint bound that reduces to the Hamming bound when c′=0c'=0. We introduce joint perfect codes and show that binary repetition codes attain the joint bound whenever n=2c+c′+1n=2c+c'+1. For codes satisfying dmin⁡=2c+c′+1d_{\min}=2c+c'+1, we investigate an alternative joint bound based on ring multiplicity and constant-weight code bounds. A further argument using the Cauchy-Schwarz inequality and pairwise ring intersections yields a refined joint bound that is always at least as strong as the original joint bound. We then incorporate an additional outer Hamming shell to obtain a Johnson-type extension. This extension provides a strict improvement for binary codes with c′=1c'=1, dmin⁡=2c+2d_{\min}=2c+2, c≥2c\geq2, and dmin⁡+2≤n≤3dmin⁡/2−1d_{\min}+2\leq n\leq3d_{\min}/2-1. These results connect sphere-packing bounds with the geometry of joint error correction and detection.

查看此版本解读 →查看此版本原文 ↗