Abstract
In this paper, an updated table of maximum minimum distances for rate 1 p binary quasi-cyclic (QC) codes is presented. Many of the new codes given attain the bounds in the table by Brouwer and Verhoeff and the expanded table maintained by Brouwer, and fourteen of these codes improve the bounds. The generator polynomials of the new QC codes which provide table improvements are given. These codes were found using integer linear programming and a heuristic combinatorial optimization algorithm.
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.
