Original scientific paper
On repeated low-density burst error detecting linear codes
Bal Kishan Dass
; Department of Mathematics, University of Delhi, New Delhi, India
Poonam Garg
; Department of Mathematics, Deen Dayal Upadhyaya College, University of Delhi, Shivaji Marg, Karam Pura, New Delhi, India
Abstract
The paper presents lower and upper bounds on the number of
parity-check digits required for a linear code that is capable of
detecting repeated low-density burst errors of length $b$ (fixed)
with weight w or less $(w \leq b)$. A bound for codes which can
correct and simultaneously detect such burst errors has also been
derived. An illustration has been provided for the code detecting
2-repeated burst errors of length 3 (fixed) with weight 2 or less
over GF(2).
Keywords
repeated burst error; low-density burst error; error detecting code; bounds on the number of check digits
Hrčak ID:
68614
URI
Publication date:
10.6.2011.
Visits: 1.601 *