AI & ML
Hamming and Johnson-Type Bounds for Joint Error Correction and Detection
arXiv math.IT0 views
arXiv:2611.18156v1 Announce Type: new Abstract: We derive upper bounds on the size of codes for joint error correction and detection over classical $q$-ary Hamming spaces. A $(c,c')$ joint error correcting and detecting code corrects every error of weight at most $c$ and detects every error whose weight lies between $c+1$ and $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'=0$. We introduce joint perfect codes and show that binary repetition codes attain the joint bound whenever $n=2c+c'+1$. For codes satisfying $d_{\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'=1$, $d_{\min}=2c+2$, $c\geq2$, and $d_{\min}+2\leq n\leq3d_{\min}/2-1$. These results connect sphere-packing bounds with the geometry of joint error correction and detection.
Source:https://arxiv.org/abs/2611.18156PreviousRate Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay NetworksNextMovable Antenna-Aided ISAC: A Time- and Frequency-Division Framework
Related posts
The King’s Trust and OpenAI launch £1m partnership
0OpenAI Blog

AI Skills and the Gender Gap: Who Gets Ahead in the Changing Job Market?
0HackerNoon

AI in Leadership: Managing People, Not Just Work
0HackerNoon
Neuroscience: What is Human Intelligence in the Brain?
0HackerNoon
How to Prevent Silent Failures in Multi-Agent AI Systems
0HackerNoon
I Created an AI Cat That Thinks for Herself. Now I Have More Questions Than Answers
0HackerNoon