Bounds on blockwise burst error correcting linear codes

Abstract This paper presents a lower and an upper bound on the number of parity check digits required for the existence of codes correcting bursts of different lengths in different blocks of a code word.