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.
Das, P. K., & Vashisht, L. K. (2016). Error Locating Codes By Using Blockwise-Tensor Product of Blockwise Detecting/Correcting Codes. Khayyam Journal of Mathematics, 2(1), 6-17. doi: 10.22034/kjm.2016.14572
MLA
Pankaj Kumar Das; Lalit K. Vashisht. "Error Locating Codes By Using Blockwise-Tensor Product of Blockwise Detecting/Correcting Codes". Khayyam Journal of Mathematics, 2, 1, 2016, 6-17. doi: 10.22034/kjm.2016.14572
HARVARD
Das, P. K., Vashisht, L. K. (2016). 'Error Locating Codes By Using Blockwise-Tensor Product of Blockwise Detecting/Correcting Codes', Khayyam Journal of Mathematics, 2(1), pp. 6-17. doi: 10.22034/kjm.2016.14572
VANCOUVER
Das, P. K., Vashisht, L. K. Error Locating Codes By Using Blockwise-Tensor Product of Blockwise Detecting/Correcting Codes. Khayyam Journal of Mathematics, 2016; 2(1): 6-17. doi: 10.22034/kjm.2016.14572
)