A general theory of cyclic codes correcting a set of given types of errors is presented. Codes published by Abramson, Fire, Melas and others are accounted for in this theory, which also offers several new classes of codes. These new codes are competitive with existing ones. In burst-error correction, for certain message lengths they may be better since they may need fewer parity check bits.
No takes yet. Share an insight, caveat, or question.
E. Gorog (1963) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: