Linear codes on solid bursts and random errors
نویسندگان
1 Shivaji College (University of Delhi)
doi
10.22108/toc.2015.6189چکیده
The paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length $b$ or less and simultaneously any $e$ or less random errors. An example of such a code is also provided. Further, codes capable of detecting and simultaneously correcting such errors have also been dealt with.
