Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
