betaFeedback

WorksComputer Science

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

Abstract

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.

Paper details

vlnc:W_twuqm9pa
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…