Document Type: Original Article
Department of Mathematical Sciences, Tezpur University, Napaam, Tezpur, Assam -784028, India
Department of Mathematics, University of Delhi, Delhi-110007, India
In this paper, we obtain lower and upper bounds on the number of parity check digits of a linear code that corrects $e$ or less errors within a sub-block. An example of such a code is provided. We introduce blockwise-tensor product of matrices and using this, we propose classes of error locating codes (or EL-codes) that can detect $e$ or less errors within a sub-block and locate several such corrupted sub-blocks.