CONSTRUCTION OF m-REPEATED BURST ERROR CORRECTING BINARY LINEAR CODE
Bal Kishan Dass, Rashmi Verma · Discrete Mathematics Algorithms and Applications · 2012
The purpose of this paper is to propose a simple method of constructing a parity-check matrix for any binary linear code capable of correcting a new kind of burst error called 'm-repeated burst error of length b or less' recently introduced by the authors. Some binary codes based on the proposed technique have been illustrated. This technique for m = 1 helps in resolving a long standing problem of devising a systematic algorithm for the construction of a burst error correcting code.