Location of Multiple Sub-Blocks with Burst Errors

Abstract

Error locating code is a concept that compromise between short and long code length and identifies the corrupted sub-block(s) containing the error occurring within subblock(s). This paper presents bounds on the number of parity check digits of such error-locating codes that are capable of not only detecting any burst error of length b or less within a sub-block, but also can locate several such corrupted sub-blocks. We also provide an example of such a code.