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
An LLM confidence score isn’t correctness: the certainty trap
0dev.to
What a host-side layer for LLM agents is, in plain words (and what it is not)
0dev.to
OpenAI's Agents API Lets Any App Rent Codex, Here's How It Works
0dev.to

94% of Singapore Small Business Owners Surveyed Say More AI Guidance Is Needed
0Meta Newsroom
Nashville, Tennessee Real Estate Dataset: 7,436 Listings, Excel File (Nov 10, 2026)
0dev.to Data
A Hundred and Eighty Six Thousand Pounds of Stock Had Left One Branch and Never Arrived at Another
0dev.to Data