Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.)
B. D. Sharma, Bal Kishan Dass · IEEE Transactions on Information Theory · 1974
The study of burst-error-correcting codes has generally been made without weight considerations while the random-error-correcting capabilities of a linear code largely depend upon the minimum weight. In this correspondence we have obtained extensions of the Varshamov-Gilbert and sphere-packing hounds to burst-error-correcting codes.