← 研踪 PaperTrailarXiv: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
摘要
We derive upper bounds on the size of codes for joint error correction and detection over classical -ary Hamming spaces. A joint error correcting and detecting code corrects every error of weight at most and detects every error whose weight lies between and . 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 . We introduce joint perfect codes and show that binary repetition codes attain the joint bound whenever . For codes satisfying , 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 , , , and . 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
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 -ary Hamming spaces. A joint error correcting and detecting code corrects every error of weight at most and detects every error whose weight lies between and . 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 . We introduce joint perfect codes and show that binary repetition codes attain the joint bound whenever . For codes satisfying , 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 , , , and . These results connect sphere-packing bounds with the geometry of joint error correction and detection.
查看此版本解读 →查看此版本原文 ↗