On repeated low-density burst error detecting linear codes
Bal Kishan Dass, Poonam Garg, Deen Dayal, Shivaji Marg, Karam Pura · University of Zagreb University Computing Centre (SRCE) · 2011
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 ≤ 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).AMS subject classifications: 94B20, 94B65, 94B25