Abstract
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. A lot of work has been done to find good QC codes with help of computers, and many good QC codes have been found. It should be noted that an exhaustive search is intractable with the increase in the code dimensions. In this paper, a local search method is used to find good binary QC codes. >
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
