Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Das et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: