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.
No takes yet. Share an insight, caveat, or question.
Calabi et al. (1959) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: