Bounds for Codes with Separately Localized Errors

This is a continuation of an earlier paper [L. A. Bassalygo et al., IEEE Trans. Inf. Theory, 37, no. 3, 880–884 (1991)] in which codes that correct partially localized errors were studied. The situation was examined in which $l$ positions (of $n$) in which errors (not more than $t$) are possible are known in coding while the remaining positions $(n-l)$ are error-free. Here we permit the presence of errors in those positions.