Error Locating Codes By Using Blockwise-Tensor Product of Blockwise Detecting/Correcting Codes
Pankaj Kumar Das, Lalit Kumar Vashisht · Khayyam journal of mathematics · 2016
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.