A class of binary systematic codes correcting errors at random and in bursts
L. Calabi, H. G. Haefeli · IEEE Transactions on Information Theory · 1959
Presentation of results concerning the performance of a family of binary systematic codes of arbitrary size, correcting bursts of considerable length and/or "random" errors. The basic idea of these codes is due to C. Hobbs of the Air Force Cambridge Research Center. For the codes of two sub-families, practical decoding schemes are given. Also formulated are results concerning the use of these codes with erasure channels.