Two classes of simple low-rate burst-correcting convolutional codes that meet the Gallager bound of

are presented. Special cases of these codes are also shown to meet the Peterson and Weldon bound of
![b \\leq [frac{1}{2}(n_A -- 1)]](/images/tex/6883.gif)
. A third class of low-rate codes that can correct iow-density type

bursts is also presented. All three classes of codes are majority-logic decodable and, hence, can be easily implemented.