Binary Constant-Weight Codes Correcting Localized Errors

Asymptotically tight solutions can be obtained from codes correcting localized errors, which is only rarely possible for general error-correcting code. This paper is yet another example of this kind: we find the asymptotically optimal rate $R(\omega,\tau)$ of a binary constant-weight code of weight $\omega n$ correcting $\tau n$ localized errors.