Abstract
In this paper a class of linear error-correcting block codes is investigated. These quasicyclic codes are closely related in structure to cyclic codes although they are not nearly as well understood. It is shown that an important subclass of the class of cyclic codes is almost equivalent to quasicyclic codes. Also, a short computer generated list of the best quasicyclic codes of rate ½ is given. The last result is a proof that there exist very long quasicyclic codes which meet the Gilbert bound.
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
